/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/loops-crafted-1/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:37:16,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:37:16,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:37:16,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:37:16,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:37:16,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:37:16,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:37:16,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:37:16,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:37:16,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:37:16,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:37:16,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:37:16,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:37:16,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:37:16,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:37:16,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:37:16,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:37:16,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:37:16,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:37:16,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:37:16,450 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:37:16,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:37:16,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:37:16,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:37:16,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:37:16,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:37:16,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:37:16,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:37:16,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:37:16,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:37:16,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:37:16,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:37:16,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:37:16,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:37:16,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:37:16,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:37:16,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:37:16,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:37:16,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:37:16,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:37:16,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:37:16,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:37:16,472 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:37:16,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:37:16,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:37:16,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:37:16,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:37:16,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:37:16,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:37:16,500 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:37:16,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:37:16,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:37:16,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:37:16,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:37:16,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:37:16,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:37:16,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:37:16,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:37:16,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:37:16,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:37:16,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:37:16,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:37:16,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:37:16,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:37:16,504 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:37:16,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:37:16,506 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:37:16,506 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:37:16,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:37:16,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:37:16,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:37:16,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:37:16,803 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:37:16,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-05 05:37:16,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2bb7fa0/7ae9c20f8b3a40ebb3f69eb72b2eaa09/FLAG13c611910 [2022-04-05 05:37:17,274 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:37:17,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-05 05:37:17,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2bb7fa0/7ae9c20f8b3a40ebb3f69eb72b2eaa09/FLAG13c611910 [2022-04-05 05:37:17,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2bb7fa0/7ae9c20f8b3a40ebb3f69eb72b2eaa09 [2022-04-05 05:37:17,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:37:17,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:37:17,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:37:17,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:37:17,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:37:17,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405fad37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17, skipping insertion in model container [2022-04-05 05:37:17,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:37:17,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:37:17,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-04-05 05:37:17,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:37:17,881 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:37:17,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-04-05 05:37:17,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:37:17,906 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:37:17,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17 WrapperNode [2022-04-05 05:37:17,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:37:17,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:37:17,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:37:17,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:37:17,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:37:17,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:37:17,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:37:17,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:37:17,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (1/1) ... [2022-04-05 05:37:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:37:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:17,972 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:37:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:37:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:37:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:37:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 05:37:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:37:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:37:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:37:18,017 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:37:18,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:37:18,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:37:18,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:37:18,003 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:37:18,080 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:37:18,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:37:18,198 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:37:18,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:37:18,203 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 05:37:18,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:37:18 BoogieIcfgContainer [2022-04-05 05:37:18,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:37:18,206 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:37:18,206 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:37:18,207 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:37:18,210 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:37:18" (1/1) ... [2022-04-05 05:37:18,213 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:37:18,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:37:18 BasicIcfg [2022-04-05 05:37:18,229 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:37:18,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:37:18,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:37:18,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:37:18,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:37:17" (1/4) ... [2022-04-05 05:37:18,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750cfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:37:18, skipping insertion in model container [2022-04-05 05:37:18,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:37:17" (2/4) ... [2022-04-05 05:37:18,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750cfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:37:18, skipping insertion in model container [2022-04-05 05:37:18,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:37:18" (3/4) ... [2022-04-05 05:37:18,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750cfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:37:18, skipping insertion in model container [2022-04-05 05:37:18,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:37:18" (4/4) ... [2022-04-05 05:37:18,239 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.cqvasr [2022-04-05 05:37:18,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:37:18,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 05:37:18,296 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:37:18,304 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:37:18,304 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 05:37:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 05:37:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:37:18,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:18,331 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:18,331 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-05 05:37:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:18,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950003901] [2022-04-05 05:37:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:18,529 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:37:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950003901] [2022-04-05 05:37:18,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950003901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:37:18,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:37:18,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 05:37:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460339403] [2022-04-05 05:37:18,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:37:18,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 05:37:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 05:37:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 05:37:18,589 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:37:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:18,643 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-05 05:37:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 05:37:18,645 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:37:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:18,650 INFO L225 Difference]: With dead ends: 30 [2022-04-05 05:37:18,651 INFO L226 Difference]: Without dead ends: 13 [2022-04-05 05:37:18,653 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:37:18,656 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:18,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:37:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-05 05:37:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-05 05:37:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 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:37:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-05 05:37:18,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-05 05:37:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:18,697 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-05 05:37:18,698 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:37:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-05 05:37:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:37:18,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:18,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:18,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:37:18,700 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-05 05:37:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183922971] [2022-04-05 05:37:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:18,839 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:37:18,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:18,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183922971] [2022-04-05 05:37:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183922971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:37:18,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:37:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 05:37:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565768385] [2022-04-05 05:37:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:37:18,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 05:37:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 05:37:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 05:37:18,845 INFO L87 Difference]: Start difference. First operand 13 states and 14 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:37:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:18,895 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-05 05:37:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 05:37:18,897 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:37:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:18,897 INFO L225 Difference]: With dead ends: 22 [2022-04-05 05:37:18,897 INFO L226 Difference]: Without dead ends: 15 [2022-04-05 05:37:18,901 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:37:18,903 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:18,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:37:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-05 05:37:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-05 05:37:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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:37:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-05 05:37:18,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-05 05:37:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:18,918 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-05 05:37:18,919 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:37:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-05 05:37:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-05 05:37:18,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:18,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:18,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:37:18,920 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-05 05:37:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:18,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481021924] [2022-04-05 05:37:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,042 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:37:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:19,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481021924] [2022-04-05 05:37:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481021924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642161696] [2022-04-05 05:37:19,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:19,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:19,045 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:37:19,047 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:37:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 05:37:19,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:37:19,183 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:37:19,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:37:19,319 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:37:19,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642161696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:37:19,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:37:19,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-05 05:37:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070103938] [2022-04-05 05:37:19,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:37:19,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 05:37:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:19,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 05:37:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:37:19,322 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:19,466 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-05 05:37:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:37:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-05 05:37:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:19,467 INFO L225 Difference]: With dead ends: 25 [2022-04-05 05:37:19,467 INFO L226 Difference]: Without dead ends: 18 [2022-04-05 05:37:19,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:37:19,469 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:19,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:37:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-05 05:37:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-05 05:37:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 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:37:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-05 05:37:19,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-05 05:37:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:19,473 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-05 05:37:19,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-05 05:37:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:37:19,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:19,474 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:19,505 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:37:19,690 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:37:19,690 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-05 05:37:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:19,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543594924] [2022-04-05 05:37:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:19,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:19,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543594924] [2022-04-05 05:37:19,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543594924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:19,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154976683] [2022-04-05 05:37:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:19,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:19,796 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:37:19,826 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:37:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:19,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 05:37:19,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:37:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:19,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:37:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:20,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154976683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:37:20,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:37:20,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-05 05:37:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574712995] [2022-04-05 05:37:20,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:37:20,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 05:37:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 05:37:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:37:20,107 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:20,411 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-05 05:37:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 05:37:20,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-05 05:37:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:20,413 INFO L225 Difference]: With dead ends: 34 [2022-04-05 05:37:20,413 INFO L226 Difference]: Without dead ends: 26 [2022-04-05 05:37:20,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-04-05 05:37:20,415 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:20,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:37:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-05 05:37:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-05 05:37:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 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:37:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-05 05:37:20,421 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-04-05 05:37:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:20,421 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-05 05:37:20,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-05 05:37:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-05 05:37:20,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:20,422 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:20,449 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:37:20,623 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:37:20,624 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:20,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-04-05 05:37:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:20,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990847475] [2022-04-05 05:37:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:20,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990847475] [2022-04-05 05:37:20,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990847475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:20,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102846007] [2022-04-05 05:37:20,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:37:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:20,805 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:37:20,807 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:37:20,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:37:20,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:37:20,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-05 05:37:20,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:37:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:20,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:37:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:37:21,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102846007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:37:21,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:37:21,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-04-05 05:37:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319157032] [2022-04-05 05:37:21,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:37:21,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-05 05:37:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-05 05:37:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-04-05 05:37:21,351 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:22,648 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-05 05:37:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-05 05:37:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-05 05:37:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:22,651 INFO L225 Difference]: With dead ends: 47 [2022-04-05 05:37:22,651 INFO L226 Difference]: Without dead ends: 36 [2022-04-05 05:37:22,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-04-05 05:37:22,653 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:22,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 05:37:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-05 05:37:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-05 05:37:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 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:37:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-05 05:37:22,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-04-05 05:37:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:22,660 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-05 05:37:22,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-05 05:37:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-05 05:37:22,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:22,662 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:22,688 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:37:22,885 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:37:22,886 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-04-05 05:37:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:22,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696572617] [2022-04-05 05:37:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 05:37:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696572617] [2022-04-05 05:37:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696572617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476908046] [2022-04-05 05:37:23,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 05:37:23,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:23,114 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:37:23,115 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:37:23,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-05 05:37:23,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:37:23,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-05 05:37:23,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:37:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 05:37:23,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:37:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-05 05:37:24,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476908046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:37:24,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:37:24,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-04-05 05:37:24,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664827874] [2022-04-05 05:37:24,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:37:24,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-05 05:37:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-05 05:37:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-04-05 05:37:24,122 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:28,556 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-05 05:37:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-05 05:37:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-05 05:37:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:28,557 INFO L225 Difference]: With dead ends: 73 [2022-04-05 05:37:28,557 INFO L226 Difference]: Without dead ends: 54 [2022-04-05 05:37:28,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-04-05 05:37:28,559 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:28,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 61 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 05:37:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-05 05:37:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-05 05:37:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 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:37:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-05 05:37:28,568 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-04-05 05:37:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:28,569 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-05 05:37:28,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-05 05:37:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 05:37:28,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:28,570 INFO L499 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:28,581 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:37:28,775 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:37:28,775 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-04-05 05:37:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:28,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963236181] [2022-04-05 05:37:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-05 05:37:28,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:28,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963236181] [2022-04-05 05:37:28,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963236181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:28,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777254137] [2022-04-05 05:37:28,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 05:37:28,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:28,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:29,000 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:37:29,011 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:37:29,069 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 05:37:29,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:37:29,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-05 05:37:29,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:37:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 05:37:29,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:37:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-05 05:37:30,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777254137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:37:30,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:37:30,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-04-05 05:37:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207196655] [2022-04-05 05:37:30,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:37:30,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-05 05:37:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:37:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-05 05:37:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-04-05 05:37:30,267 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:37:54,975 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-05 05:37:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-05 05:37:54,976 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-05 05:37:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:37:54,977 INFO L225 Difference]: With dead ends: 116 [2022-04-05 05:37:54,977 INFO L226 Difference]: Without dead ends: 86 [2022-04-05 05:37:54,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-04-05 05:37:54,979 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:37:54,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 05:37:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-05 05:37:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-05 05:37:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 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:37:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-05 05:37:54,993 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-04-05 05:37:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:37:54,994 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-05 05:37:54,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:37:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-05 05:37:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-05 05:37:54,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:37:54,996 INFO L499 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:37:55,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-05 05:37:55,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:55,210 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:37:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:37:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-04-05 05:37:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:37:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056375888] [2022-04-05 05:37:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:37:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:37:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:37:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:37:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-05 05:37:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:37:55,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056375888] [2022-04-05 05:37:55,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056375888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:37:55,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243590117] [2022-04-05 05:37:55,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 05:37:55,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:37:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:37:55,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:37:55,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 05:38:04,570 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-04-05 05:38:04,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:38:04,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-05 05:38:04,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:38:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 05:38:05,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:38:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-05 05:38:07,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243590117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:38:07,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:38:07,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-04-05 05:38:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791511594] [2022-04-05 05:38:07,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:38:07,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-05 05:38:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:38:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-05 05:38:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-04-05 05:38:07,622 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:38:43,743 WARN L232 SmtUtils]: Spent 10.89s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:39:25,702 WARN L232 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:40:02,804 WARN L232 SmtUtils]: Spent 10.71s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:40:37,703 WARN L232 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:40:39,737 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse25 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000))))) is different from false [2022-04-05 05:41:19,374 WARN L232 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 196 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:41:50,221 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse23 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000))))) is different from false [2022-04-05 05:41:52,259 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse23 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000))))) is different from false [2022-04-05 05:42:50,026 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse21 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000))))) is different from false [2022-04-05 05:43:38,408 WARN L232 SmtUtils]: Spent 17.66s on a formula simplification. DAG size of input: 200 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:44:32,115 WARN L232 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 167 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:45:38,220 WARN L232 SmtUtils]: Spent 32.58s on a formula simplification. DAG size of input: 207 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:47:01,551 WARN L232 SmtUtils]: Spent 28.01s on a formula simplification. DAG size of input: 214 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:48:31,098 WARN L232 SmtUtils]: Spent 35.28s on a formula simplification. DAG size of input: 221 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:49:56,369 WARN L232 SmtUtils]: Spent 38.92s on a formula simplification. DAG size of input: 228 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:50:17,546 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod c_main_~x~0 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse30 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000))))) is different from false [2022-04-05 05:51:02,922 WARN L232 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 224 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)