/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-acceleration/functions_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:20:28,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:20:28,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:20:28,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:20:28,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:20:28,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:20:28,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:20:28,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:20:28,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:20:28,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:20:28,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:20:28,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:20:28,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:20:28,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:20:28,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:20:28,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:20:28,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:20:28,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:20:28,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:20:28,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:20:28,047 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:20:28,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:20:28,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:20:28,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:20:28,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:20:28,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:20:28,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:20:28,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:20:28,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:20:28,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:20:28,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:20:28,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:20:28,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:20:28,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:20:28,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:20:28,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:20:28,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:20:28,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:20:28,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:20:28,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:20:28,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:20:28,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:20:28,059 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:20:28,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:20:28,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:20:28,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:20:28,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:20:28,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:20:28,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:20:28,079 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:20:28,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:20:28,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:20:28,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:20:28,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:28,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:20:28,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:20:28,083 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:20:28,083 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:20:28,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:20:28,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:20:28,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:20:28,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:20:28,284 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:20:28,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-27 21:20:28,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628373d01/4479619b1bf844e5b2a4f2d2b71af59b/FLAG264445175 [2022-04-27 21:20:28,670 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:20:28,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-27 21:20:28,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628373d01/4479619b1bf844e5b2a4f2d2b71af59b/FLAG264445175 [2022-04-27 21:20:29,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628373d01/4479619b1bf844e5b2a4f2d2b71af59b [2022-04-27 21:20:29,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:20:29,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:20:29,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:29,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:20:29,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:20:29,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603a4113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29, skipping insertion in model container [2022-04-27 21:20:29,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:20:29,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:20:29,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-27 21:20:29,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:29,312 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:20:29,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-27 21:20:29,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:29,335 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:20:29,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29 WrapperNode [2022-04-27 21:20:29,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:29,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:20:29,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:20:29,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:20:29,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:20:29,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:20:29,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:20:29,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:20:29,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:29,378 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:20:29,385 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:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-27 21:20:29,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:20:29,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:20:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:20:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:20:29,439 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:20:29,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:20:29,543 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:20:29,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:20:29,548 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:20:29,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:29 BoogieIcfgContainer [2022-04-27 21:20:29,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:20:29,549 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:20:29,550 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:20:29,552 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:20:29,554 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:29" (1/1) ... [2022-04-27 21:20:29,555 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:20:29,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:29 BasicIcfg [2022-04-27 21:20:29,575 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:20:29,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:20:29,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:20:29,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:20:29,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:20:29" (1/4) ... [2022-04-27 21:20:29,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117611e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:29, skipping insertion in model container [2022-04-27 21:20:29,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:29" (2/4) ... [2022-04-27 21:20:29,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117611e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:29, skipping insertion in model container [2022-04-27 21:20:29,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:29" (3/4) ... [2022-04-27 21:20:29,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117611e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:29, skipping insertion in model container [2022-04-27 21:20:29,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:29" (4/4) ... [2022-04-27 21:20:29,584 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-1.cqvasr [2022-04-27 21:20:29,596 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:20:29,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:20:29,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:20:29,645 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@347aa5ed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6141e1b7 [2022-04-27 21:20:29,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:20:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:20:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:20:29,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:29,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:29,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1565505021, now seen corresponding path program 1 times [2022-04-27 21:20:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:29,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737156187] [2022-04-27 21:20:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:29,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 21:20:29,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 21:20:29,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 21:20:29,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:29,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 21:20:29,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 21:20:29,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 21:20:29,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 21:20:29,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [49] mainENTRY-->L19-2: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {26#true} is VALID [2022-04-27 21:20:29,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [51] L19-2-->L19-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 21:20:29,825 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} [54] L19-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {27#false} is VALID [2022-04-27 21:20:29,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [57] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 21:20:29,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [60] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 21:20:29,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 21:20:29,826 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:20:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:29,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737156187] [2022-04-27 21:20:29,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737156187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:29,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:29,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:20:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878242541] [2022-04-27 21:20:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:20:29,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:29,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:29,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:29,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:20:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:20:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:20:29,883 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:29,963 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 21:20:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:20:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:20:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:20:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:20:29,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 21:20:30,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:30,028 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:20:30,028 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:20:30,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:20:30,035 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:30,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:20:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:20:30,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:30,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,063 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,063 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:30,067 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 21:20:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:20:30,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:30,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:30,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 21:20:30,068 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 21:20:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:30,070 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 21:20:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:20:30,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:30,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:30,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:30,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 21:20:30,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-27 21:20:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:30,076 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 21:20:30,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 21:20:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:20:30,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:30,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:30,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:20:30,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1564581500, now seen corresponding path program 1 times [2022-04-27 21:20:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315211817] [2022-04-27 21:20:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {139#true} is VALID [2022-04-27 21:20:30,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 21:20:30,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 21:20:30,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:30,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {139#true} is VALID [2022-04-27 21:20:30,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 21:20:30,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 21:20:30,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#true} is VALID [2022-04-27 21:20:30,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} [49] mainENTRY-->L19-2: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {144#(= main_~x~0 0)} is VALID [2022-04-27 21:20:30,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(= main_~x~0 0)} [52] L19-2-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 21:20:30,201 INFO L272 TraceCheckUtils]: 7: Hoare triple {140#false} [54] L19-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {140#false} is VALID [2022-04-27 21:20:30,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#false} [57] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {140#false} is VALID [2022-04-27 21:20:30,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} [60] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 21:20:30,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#false} is VALID [2022-04-27 21:20:30,202 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:20:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:30,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315211817] [2022-04-27 21:20:30,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315211817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:30,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:30,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:20:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640578563] [2022-04-27 21:20:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:20:30,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:30,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:30,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:20:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:20:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:20:30,213 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:30,265 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 21:20:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:20:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:20:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:20:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:20:30,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 21:20:30,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:30,288 INFO L225 Difference]: With dead ends: 25 [2022-04-27 21:20:30,288 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 21:20:30,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:20:30,289 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:30,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 21:20:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-27 21:20:30,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:30,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,293 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,293 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:30,294 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 21:20:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 21:20:30,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:30,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:30,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 21:20:30,295 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 21:20:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:30,296 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 21:20:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 21:20:30,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:30,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:30,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:30,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 21:20:30,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-27 21:20:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:30,298 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 21:20:30,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 21:20:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:20:30,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:30,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:30,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:20:30,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1890585047, now seen corresponding path program 1 times [2022-04-27 21:20:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:30,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777928558] [2022-04-27 21:20:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {256#true} is VALID [2022-04-27 21:20:30,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 21:20:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} [59] fENTRY-->fFINAL: Formula: (and (= |v_f_#res_1| (+ 2 v_f_~z_1)) (= |v_f_#in~z_1| v_f_~z_1)) InVars {f_#in~z=|v_f_#in~z_1|} OutVars{f_~z=v_f_~z_1, f_#in~z=|v_f_#in~z_1|, f_#res=|v_f_#res_1|} AuxVars[] AssignedVars[f_~z, f_#res] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} [62] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} [68] fEXIT-->L20-1: AOR: Formula: (= |v_main_#t~ret4_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{main_#t~ret4=|v_main_#t~ret4_4|} AuxVars[] AssignedVars[main_#t~ret4, f_#res] LVA: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 21:20:30,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:30,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {256#true} is VALID [2022-04-27 21:20:30,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} [49] mainENTRY-->L19-2: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {261#(= main_~x~0 0)} is VALID [2022-04-27 21:20:30,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} [53] L19-2-->L20: Formula: (< (mod v_main_~x~0_4 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {261#(= main_~x~0 0)} is VALID [2022-04-27 21:20:30,461 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} [55] L20-->fENTRY: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {256#true} is VALID [2022-04-27 21:20:30,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} [59] fENTRY-->fFINAL: Formula: (and (= |v_f_#res_1| (+ 2 v_f_~z_1)) (= |v_f_#in~z_1| v_f_~z_1)) InVars {f_#in~z=|v_f_#in~z_1|} OutVars{f_~z=v_f_~z_1, f_#in~z=|v_f_#in~z_1|, f_#res=|v_f_#res_1|} AuxVars[] AssignedVars[f_~z, f_#res] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} [62] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} [68] fEXIT-->L20-1: AOR: Formula: (= |v_main_#t~ret4_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{main_#t~ret4=|v_main_#t~ret4_4|} AuxVars[] AssignedVars[main_#t~ret4, f_#res] LVA: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 21:20:30,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} [58] L20-1-->L19-2: Formula: (= v_main_~x~0_6 |v_main_#t~ret4_3|) InVars {main_#t~ret4=|v_main_#t~ret4_3|} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~ret4] {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:20:30,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [52] L19-2-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,465 INFO L272 TraceCheckUtils]: 13: Hoare triple {257#false} [54] L19-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {257#false} is VALID [2022-04-27 21:20:30,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#false} [57] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {257#false} is VALID [2022-04-27 21:20:30,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#false} [60] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:30,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777928558] [2022-04-27 21:20:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777928558] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:30,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908098085] [2022-04-27 21:20:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:30,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:30,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:30,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:20:30,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:20:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 21:20:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:30,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:20:30,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {256#true} is VALID [2022-04-27 21:20:30,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} [49] mainENTRY-->L19-2: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {261#(= main_~x~0 0)} is VALID [2022-04-27 21:20:30,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} [53] L19-2-->L20: Formula: (< (mod v_main_~x~0_4 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {261#(= main_~x~0 0)} is VALID [2022-04-27 21:20:30,812 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} [55] L20-->fENTRY: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {256#true} is VALID [2022-04-27 21:20:30,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} [59] fENTRY-->fFINAL: Formula: (and (= |v_f_#res_1| (+ 2 v_f_~z_1)) (= |v_f_#in~z_1| v_f_~z_1)) InVars {f_#in~z=|v_f_#in~z_1|} OutVars{f_~z=v_f_~z_1, f_#in~z=|v_f_#in~z_1|, f_#res=|v_f_#res_1|} AuxVars[] AssignedVars[f_~z, f_#res] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} [62] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 21:20:30,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} [68] fEXIT-->L20-1: AOR: Formula: (= |v_main_#t~ret4_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{main_#t~ret4=|v_main_#t~ret4_4|} AuxVars[] AssignedVars[main_#t~ret4, f_#res] LVA: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 21:20:30,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} [58] L20-1-->L19-2: Formula: (= v_main_~x~0_6 |v_main_#t~ret4_3|) InVars {main_#t~ret4=|v_main_#t~ret4_3|} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~ret4] {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:20:30,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [52] L19-2-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:20:30,815 INFO L272 TraceCheckUtils]: 13: Hoare triple {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L19-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:20:30,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:20:30,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {316#(<= 1 __VERIFIER_assert_~cond)} [60] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:30,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:20:30,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {316#(<= 1 __VERIFIER_assert_~cond)} [60] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-27 21:20:30,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:20:30,979 INFO L272 TraceCheckUtils]: 13: Hoare triple {332#(= (mod main_~x~0 2) 0)} [54] L19-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:20:30,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#(= (mod main_~x~0 2) 0)} [52] L19-2-->L19-3: Formula: (not (< (mod v_main_~x~0_3 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:20:30,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#(= (mod |main_#t~ret4| 2) 0)} [58] L20-1-->L19-2: Formula: (= v_main_~x~0_6 |v_main_#t~ret4_3|) InVars {main_#t~ret4=|v_main_#t~ret4_3|} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~ret4] {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:20:30,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} {332#(= (mod main_~x~0 2) 0)} [68] fEXIT-->L20-1: AOR: Formula: (= |v_main_#t~ret4_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{main_#t~ret4=|v_main_#t~ret4_4|} AuxVars[] AssignedVars[main_#t~ret4, f_#res] LVA: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {339#(= (mod |main_#t~ret4| 2) 0)} is VALID [2022-04-27 21:20:30,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} [62] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-27 21:20:30,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} [59] fENTRY-->fFINAL: Formula: (and (= |v_f_#res_1| (+ 2 v_f_~z_1)) (= |v_f_#in~z_1| v_f_~z_1)) InVars {f_#in~z=|v_f_#in~z_1|} OutVars{f_~z=v_f_~z_1, f_#in~z=|v_f_#in~z_1|, f_#res=|v_f_#res_1|} AuxVars[] AssignedVars[f_~z, f_#res] {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-27 21:20:30,982 INFO L272 TraceCheckUtils]: 7: Hoare triple {332#(= (mod main_~x~0 2) 0)} [55] L20-->fENTRY: Formula: (= |v_f_#in~zInParam_1| v_main_~x~0_7) InVars {main_~x~0=v_main_~x~0_7} OutVars{f_#in~z=|v_f_#in~zInParam_1|} AuxVars[] AssignedVars[main_~x~0, f_#in~z] {256#true} is VALID [2022-04-27 21:20:30,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= (mod main_~x~0 2) 0)} [53] L19-2-->L20: Formula: (< (mod v_main_~x~0_4 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:20:30,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} [49] mainENTRY-->L19-2: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:20:30,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} [47] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {256#true} is VALID [2022-04-27 21:20:30,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-27 21:20:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:20:30,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908098085] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:30,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:20:30,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 13 [2022-04-27 21:20:30,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995422112] [2022-04-27 21:20:30,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:30,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 21:20:30,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:30,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:30,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:30,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:20:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:20:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:20:30,999 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:31,123 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:20:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:20:31,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 21:20:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 21:20:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 21:20:31,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-27 21:20:31,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:31,141 INFO L225 Difference]: With dead ends: 18 [2022-04-27 21:20:31,142 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:20:31,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:20:31,145 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:31,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:20:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:20:31,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:31,147 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:20:31,147 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:20:31,147 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:20:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:31,148 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:31,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:31,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:31,148 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:20:31,148 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:20:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:31,148 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:31,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:31,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:31,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:31,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:31,148 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:20:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:20:31,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 21:20:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:31,149 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:20:31,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:20:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:31,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:31,151 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:20:31,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:20:31,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:31,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:20:31,387 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:20:31,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:31,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:31,388 INFO L902 garLoopResultBuilder]: At program point fENTRY(lines 12 14) the Hoare annotation is: true [2022-04-27 21:20:31,388 INFO L899 garLoopResultBuilder]: For program point fFINAL(lines 12 14) no Hoare annotation was computed. [2022-04-27 21:20:31,388 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-27 21:20:31,388 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:20:31,388 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:20:31,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:31,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:31,388 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 24) the Hoare annotation is: true [2022-04-27 21:20:31,388 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:20:31,388 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:20:31,388 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:20:31,388 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 24) no Hoare annotation was computed. [2022-04-27 21:20:31,389 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-04-27 21:20:31,390 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 24) no Hoare annotation was computed. [2022-04-27 21:20:31,390 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 21:20:31,390 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 21:20:31,390 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 21:20:31,390 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:20:31,391 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 21:20:31,391 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:20:31,395 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:20:31,396 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:20:31,400 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:31,400 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:20:31,400 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-04-27 21:20:31,400 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:20:31,401 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:20:31,401 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:20:31,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:31 BasicIcfg [2022-04-27 21:20:31,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:20:31,408 INFO L158 Benchmark]: Toolchain (without parser) took 2265.71ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 119.8MB in the beginning and 129.6MB in the end (delta: -9.8MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,408 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory was 135.7MB in the beginning and 135.7MB in the end (delta: 65.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:20:31,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.05ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 119.6MB in the beginning and 192.1MB in the end (delta: -72.5MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,409 INFO L158 Benchmark]: Boogie Preprocessor took 16.39ms. Allocated memory is still 221.2MB. Free memory was 192.1MB in the beginning and 190.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,409 INFO L158 Benchmark]: RCFGBuilder took 195.19ms. Allocated memory is still 221.2MB. Free memory was 190.6MB in the beginning and 180.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,409 INFO L158 Benchmark]: IcfgTransformer took 25.47ms. Allocated memory is still 221.2MB. Free memory was 180.8MB in the beginning and 179.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,409 INFO L158 Benchmark]: TraceAbstraction took 1829.18ms. Allocated memory is still 221.2MB. Free memory was 178.8MB in the beginning and 129.6MB in the end (delta: 49.2MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2022-04-27 21:20:31,410 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 177.2MB. Free memory was 135.7MB in the beginning and 135.7MB in the end (delta: 65.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.05ms. Allocated memory was 177.2MB in the beginning and 221.2MB in the end (delta: 44.0MB). Free memory was 119.6MB in the beginning and 192.1MB in the end (delta: -72.5MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.39ms. Allocated memory is still 221.2MB. Free memory was 192.1MB in the beginning and 190.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.19ms. Allocated memory is still 221.2MB. Free memory was 190.6MB in the beginning and 180.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 25.47ms. Allocated memory is still 221.2MB. Free memory was 180.8MB in the beginning and 179.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1829.18ms. Allocated memory is still 221.2MB. Free memory was 178.8MB in the beginning and 129.6MB in the end (delta: 49.2MB). Peak memory consumption was 49.2MB. 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: 7]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 46 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 13 NumberOfFragments, 27 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 3 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 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: 19]: Loop Invariant Derived loop invariant: x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:20:31,434 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...