/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:47:58,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:47:58,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:47:58,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:47:58,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:47:58,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:47:58,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:47:58,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:47:58,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:47:58,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:47:58,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:47:58,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:47:58,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:47:58,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:47:58,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:47:58,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:47:58,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:47:58,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:47:58,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:47:58,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:47:58,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:47:58,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:47:58,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:47:58,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:47:58,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:47:58,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:47:58,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:47:58,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:47:58,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:47:58,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:47:58,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:47:58,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:47:58,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:47:58,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:47:58,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:47:58,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:47:58,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:47:58,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:47:58,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:47:58,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:47:58,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:47:58,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:47:58,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:47:58,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:47:58,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:47:58,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:47:58,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:47:58,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:47:58,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:47:58,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:47:58,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:47:58,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:47:58,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:47:58,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:47:58,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:47:58,511 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:47:58,511 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-27 21:47:58,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:47:58,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:47:58,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:47:58,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:47:58,717 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:47:58,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-27 21:47:58,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15a97d7/f18d88ab79de45d6b617be2b9b270556/FLAG812daf3bf [2022-04-27 21:47:59,130 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:47:59,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-27 21:47:59,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15a97d7/f18d88ab79de45d6b617be2b9b270556/FLAG812daf3bf [2022-04-27 21:47:59,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15a97d7/f18d88ab79de45d6b617be2b9b270556 [2022-04-27 21:47:59,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:47:59,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:47:59,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:47:59,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:47:59,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:47:59,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6808f1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59, skipping insertion in model container [2022-04-27 21:47:59,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:47:59,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:47:59,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-27 21:47:59,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:47:59,355 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:47:59,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-27 21:47:59,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:47:59,386 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:47:59,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59 WrapperNode [2022-04-27 21:47:59,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:47:59,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:47:59,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:47:59,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:47:59,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:47:59,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:47:59,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:47:59,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:47:59,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (1/1) ... [2022-04-27 21:47:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:47:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:47:59,454 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-27 21:47:59,456 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-27 21:47:59,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:47:59,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:47:59,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:47:59,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:47:59,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:47:59,527 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:47:59,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:48:08,354 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:48:08,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:48:08,362 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:48:08,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:48:08 BoogieIcfgContainer [2022-04-27 21:48:08,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:48:08,364 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:48:08,364 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:48:08,365 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:48:08,367 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:48:08" (1/1) ... [2022-04-27 21:48:08,368 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:48:08,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:48:08 BasicIcfg [2022-04-27 21:48:08,386 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:48:08,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:48:08,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:48:08,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:48:08,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:47:59" (1/4) ... [2022-04-27 21:48:08,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1333e3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:48:08, skipping insertion in model container [2022-04-27 21:48:08,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:47:59" (2/4) ... [2022-04-27 21:48:08,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1333e3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:48:08, skipping insertion in model container [2022-04-27 21:48:08,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:48:08" (3/4) ... [2022-04-27 21:48:08,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1333e3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:48:08, skipping insertion in model container [2022-04-27 21:48:08,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:48:08" (4/4) ... [2022-04-27 21:48:08,391 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.cqvasr [2022-04-27 21:48:08,400 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:48:08,400 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:48:08,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:48:08,444 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@90bd71a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d275fce [2022-04-27 21:48:08,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:48:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:48:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:48:08,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:48:08,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:48:08,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:48:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:48:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1219544613, now seen corresponding path program 1 times [2022-04-27 21:48:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:48:08,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247612795] [2022-04-27 21:48:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:48:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:48:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:48:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:48:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:48:09,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-27 21:48:09,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:48:09,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:48:09,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:48:09,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-27 21:48:09,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:48:09,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:48:09,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 21:48:09,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:48:09,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:48:09,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:48:11,195 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [84] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_112_0~0=v_~__tmp_112_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_112_0~0, main_~main__x~0, main_~main__y~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 21:48:11,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:48:11,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:48:11,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:48:11,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:48:11,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 21:48:11,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 21:48:11,224 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-27 21:48:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:48:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247612795] [2022-04-27 21:48:11,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247612795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:48:11,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:48:11,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:48:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066182091] [2022-04-27 21:48:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:48:11,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:48:11,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:48:11,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:48:13,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:48:13,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:48:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:48:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:48:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:48:13,439 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:48:17,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:19,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:24,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:26,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:28,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:30,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:37,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:39,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:42,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:44,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:46,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:53,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:57,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:48:59,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:01,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:03,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:06,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:08,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:12,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:14,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:17,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:49:17,099 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-27 21:49:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:49:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:49:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:49:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 21:49:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 21:49:17,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-27 21:49:19,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:49:19,342 INFO L225 Difference]: With dead ends: 71 [2022-04-27 21:49:19,342 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 21:49:19,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:49:19,346 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2022-04-27 21:49:19,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 20 Unknown, 0 Unchecked, 44.9s Time] [2022-04-27 21:49:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 21:49:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 21:49:19,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:49:19,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:19,373 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:19,373 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:49:19,376 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 21:49:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 21:49:19,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:49:19,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:49:19,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 21:49:19,377 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 21:49:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:49:19,379 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 21:49:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 21:49:19,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:49:19,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:49:19,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:49:19,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:49:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-27 21:49:19,384 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-27 21:49:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:49:19,385 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-27 21:49:19,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 21:49:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:49:19,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:49:19,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:49:19,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:49:19,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:49:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:49:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -791971888, now seen corresponding path program 1 times [2022-04-27 21:49:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:49:19,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059674255] [2022-04-27 21:49:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:49:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:49:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:49:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:49:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:49:19,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {251#true} is VALID [2022-04-27 21:49:19,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-27 21:49:19,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-27 21:49:19,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:49:19,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {251#true} is VALID [2022-04-27 21:49:19,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-27 21:49:19,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-27 21:49:19,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-27 21:49:19,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 21:49:19,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 21:49:19,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 21:49:19,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 21:49:21,843 WARN L290 TraceCheckUtils]: 9: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [88] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_0~0, main_~main__x~0, main_~main__y~0] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 21:49:21,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~1] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:49:21,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:49:21,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:49:21,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {258#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:49:21,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-27 21:49:21,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-27 21:49:21,854 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-27 21:49:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:49:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059674255] [2022-04-27 21:49:21,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059674255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:49:21,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:49:21,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:49:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957147766] [2022-04-27 21:49:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:49:21,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:49:21,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:49:21,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:24,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:49:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:49:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:49:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:49:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:49:24,013 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:28,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:30,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:36,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:43,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:45,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:50,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:52,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:49:58,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:01,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:07,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:12,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:16,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:18,775 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-27 21:50:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:50:18,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:50:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:50:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 21:50:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 21:50:18,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 21:50:21,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:50:21,054 INFO L225 Difference]: With dead ends: 60 [2022-04-27 21:50:21,054 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 21:50:21,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:50:21,055 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2022-04-27 21:50:21,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 25.6s Time] [2022-04-27 21:50:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 21:50:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-27 21:50:21,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:50:21,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:21,066 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:21,067 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:21,069 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 21:50:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 21:50:21,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:21,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:21,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 21:50:21,076 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 21:50:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:21,078 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 21:50:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 21:50:21,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:21,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:21,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:50:21,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:50:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 21:50:21,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-27 21:50:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:50:21,080 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 21:50:21,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 21:50:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:50:21,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:50:21,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:50:21,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:50:21,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:50:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:50:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 364986418, now seen corresponding path program 1 times [2022-04-27 21:50:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:50:21,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939132625] [2022-04-27 21:50:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:50:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:50:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:50:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:21,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {475#true} is VALID [2022-04-27 21:50:21,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:50:21,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {475#true} is VALID [2022-04-27 21:50:21,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#true} [89] L117-->L128: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#true} [92] L128-->L134: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_3, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {475#true} is VALID [2022-04-27 21:50:21,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {475#true} is VALID [2022-04-27 21:50:21,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {475#true} is VALID [2022-04-27 21:50:21,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {475#true} is VALID [2022-04-27 21:50:23,437 WARN L290 TraceCheckUtils]: 14: Hoare triple {475#true} [84] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_112_0~0=v_~__tmp_112_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_112_0~0, main_~main__x~0, main_~main__y~0] {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 21:50:23,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~0] {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:50:23,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:50:23,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:50:23,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {481#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:50:23,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {476#false} is VALID [2022-04-27 21:50:23,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#false} is VALID [2022-04-27 21:50:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 21:50:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:50:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939132625] [2022-04-27 21:50:23,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939132625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:50:23,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:50:23,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:50:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043063624] [2022-04-27 21:50:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:50:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:50:23,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:50:23,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:25,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:50:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:50:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:50:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:50:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:50:25,656 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:29,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:32,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:36,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:38,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:40,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:42,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:45,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:49,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:54,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:56,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:00,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:07,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:09,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:51:11,604 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-27 21:51:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:51:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 21:51:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:51:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 21:51:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 21:51:11,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-27 21:51:16,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 21:51:16,022 INFO L225 Difference]: With dead ends: 65 [2022-04-27 21:51:16,023 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 21:51:16,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:51:16,023 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:51:16,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 27.3s Time] [2022-04-27 21:51:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 21:51:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-27 21:51:16,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:51:16,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:16,032 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:16,032 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:51:16,034 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 21:51:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 21:51:16,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:51:16,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:51:16,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 21:51:16,034 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 21:51:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:51:16,036 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 21:51:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 21:51:16,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:51:16,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:51:16,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:51:16,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:51:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 21:51:16,037 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-27 21:51:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:51:16,037 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 21:51:16,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 21:51:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:51:16,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:51:16,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:51:16,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:51:16,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:51:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:51:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1083849817, now seen corresponding path program 1 times [2022-04-27 21:51:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:51:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095190952] [2022-04-27 21:51:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:51:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:51:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:51:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:51:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:51:16,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {713#true} is VALID [2022-04-27 21:51:16,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {713#true} {713#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:51:16,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {713#true} is VALID [2022-04-27 21:51:16,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {713#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#true} [89] L117-->L128: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#true} [92] L128-->L134: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_3, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {713#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {713#true} is VALID [2022-04-27 21:51:16,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:16,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {713#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:51:18,390 WARN L290 TraceCheckUtils]: 15: Hoare triple {713#true} [88] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_0~0, main_~main__x~0, main_~main__y~0] {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 21:51:18,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~1] {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:51:18,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:51:18,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 21:51:18,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {719#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:51:18,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-27 21:51:18,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-27 21:51:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:51:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:51:18,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095190952] [2022-04-27 21:51:18,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095190952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:51:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:51:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:51:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182503383] [2022-04-27 21:51:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:51:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:51:18,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:51:18,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:20,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:51:20,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:51:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:51:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:51:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:51:20,600 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:24,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:27,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:29,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:31,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:35,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:37,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:40,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:42,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:46,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:48,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:55,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:57,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:51:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:51:57,795 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 21:51:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:51:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:51:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:51:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 21:51:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:51:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 21:51:57,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 21:52:02,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 21:52:02,212 INFO L225 Difference]: With dead ends: 59 [2022-04-27 21:52:02,212 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:52:02,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:52:02,214 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:52:02,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 25.1s Time] [2022-04-27 21:52:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:52:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:52:02,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:52:02,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:52:02,215 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:52:02,215 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:52:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:52:02,215 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:52:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:52:02,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:52:02,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:52:02,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:52:02,215 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:52:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:52:02,215 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:52:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:52:02,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:52:02,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:52:02,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:52:02,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:52:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:52:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:52:02,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 21:52:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:52:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:52:02,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:52:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:52:02,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:52:02,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:52:02,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:52:02,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:52:02,281 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:52:02,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:52:02,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:52:02,281 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:52:02,282 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 16 151) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|)) [2022-04-27 21:52:02,282 INFO L902 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 150) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 145) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 151) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L895 garLoopResultBuilder]: At program point L44(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 144) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 151) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L895 garLoopResultBuilder]: At program point L56(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 21:52:02,282 INFO L895 garLoopResultBuilder]: At program point L122(lines 25 145) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 143) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 113) no Hoare annotation was computed. [2022-04-27 21:52:02,282 INFO L902 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-27 21:52:02,282 INFO L902 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-27 21:52:02,296 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 86) no Hoare annotation was computed. [2022-04-27 21:52:02,296 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 112) no Hoare annotation was computed. [2022-04-27 21:52:02,296 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 85) no Hoare annotation was computed. [2022-04-27 21:52:02,296 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 106) no Hoare annotation was computed. [2022-04-27 21:52:02,297 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 84) no Hoare annotation was computed. [2022-04-27 21:52:02,297 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-27 21:52:02,297 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) no Hoare annotation was computed. [2022-04-27 21:52:02,299 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 21:52:02,301 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:52:02,305 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:52:02,306 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:52:02,306 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 21:52:02,306 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:52:02,306 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 21:52:02,306 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 21:52:02,307 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:52:02,307 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:52:02,307 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:52:02,308 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:52:02,308 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 21:52:02,308 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:52:02,308 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 21:52:02,309 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 21:52:02,310 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 21:52:02,310 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:52:02,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:52:02 BasicIcfg [2022-04-27 21:52:02,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:52:02,337 INFO L158 Benchmark]: Toolchain (without parser) took 243191.64ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 127.7MB in the beginning and 189.9MB in the end (delta: -62.1MB). Peak memory consumption was 94.0MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,337 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:52:02,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.73ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 154.2MB in the end (delta: -26.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,338 INFO L158 Benchmark]: Boogie Preprocessor took 25.48ms. Allocated memory is still 178.3MB. Free memory was 154.2MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,338 INFO L158 Benchmark]: RCFGBuilder took 8950.05ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 138.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,338 INFO L158 Benchmark]: IcfgTransformer took 21.42ms. Allocated memory is still 178.3MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,339 INFO L158 Benchmark]: TraceAbstraction took 233949.54ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 189.9MB in the end (delta: -53.0MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. [2022-04-27 21:52:02,340 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.73ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 154.2MB in the end (delta: -26.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.48ms. Allocated memory is still 178.3MB. Free memory was 154.2MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8950.05ms. Allocated memory is still 178.3MB. Free memory was 152.6MB in the beginning and 138.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 21.42ms. Allocated memory is still 178.3MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 233949.54ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 189.9MB in the end (delta: -53.0MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 99]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 233.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 215.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 56 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 122.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 116.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 187 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:52:02,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...