/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-invariants/odd.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:30:47,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:30:47,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:30:47,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:30:47,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:30:47,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:30:47,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:30:47,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:30:47,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:30:47,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:30:47,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:30:47,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:30:47,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:30:47,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:30:47,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:30:47,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:30:47,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:30:47,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:30:48,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:30:48,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:30:48,002 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:30:48,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:30:48,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:30:48,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:30:48,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:30:48,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:30:48,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:30:48,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:30:48,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:30:48,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:30:48,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:30:48,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:30:48,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:30:48,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:30:48,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:30:48,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:30:48,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:30:48,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:30:48,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:30:48,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:30:48,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:30:48,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:30:48,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:30:48,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:30:48,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:30:48,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:30:48,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:30:48,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:30:48,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:30:48,057 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:30:48,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:30:48,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:30:48,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:30:48,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:30:48,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:30:48,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:30:48,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:30:48,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:30:48,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:30:48,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:30:48,061 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:30:48,062 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-15 01:30:48,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:30:48,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:30:48,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:30:48,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:30:48,328 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:30:48,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/odd.c [2022-04-15 01:30:48,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355272a27/19f431a848044fec81d58a26d1d99aa7/FLAGf376e08e3 [2022-04-15 01:30:48,723 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:30:48,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/odd.c [2022-04-15 01:30:48,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355272a27/19f431a848044fec81d58a26d1d99aa7/FLAGf376e08e3 [2022-04-15 01:30:49,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355272a27/19f431a848044fec81d58a26d1d99aa7 [2022-04-15 01:30:49,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:30:49,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:30:49,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:30:49,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:30:49,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:30:49,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5d79be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49, skipping insertion in model container [2022-04-15 01:30:49,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:30:49,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:30:49,294 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-invariants/odd.c[350,363] [2022-04-15 01:30:49,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:30:49,308 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:30:49,318 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-invariants/odd.c[350,363] [2022-04-15 01:30:49,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:30:49,331 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:30:49,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49 WrapperNode [2022-04-15 01:30:49,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:30:49,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:30:49,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:30:49,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:30:49,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:30:49,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:30:49,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:30:49,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:30:49,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:30:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:30:49,392 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-15 01:30:49,395 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-15 01:30:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:30:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:30:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:30:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:30:49,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:30:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:30:49,418 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:30:49,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:30:49,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:30:49,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:30:49,469 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:30:49,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:30:49,605 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:30:49,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:30:49,611 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:30:49,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:49 BoogieIcfgContainer [2022-04-15 01:30:49,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:30:49,613 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:30:49,613 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:30:49,623 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:30:49,626 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:49" (1/1) ... [2022-04-15 01:30:49,628 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:30:49,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:30:49 BasicIcfg [2022-04-15 01:30:49,655 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:30:49,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:30:49,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:30:49,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:30:49,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:30:49" (1/4) ... [2022-04-15 01:30:49,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a80f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:49, skipping insertion in model container [2022-04-15 01:30:49,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:49" (2/4) ... [2022-04-15 01:30:49,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a80f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:49, skipping insertion in model container [2022-04-15 01:30:49,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:49" (3/4) ... [2022-04-15 01:30:49,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a80f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:30:49, skipping insertion in model container [2022-04-15 01:30:49,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:30:49" (4/4) ... [2022-04-15 01:30:49,676 INFO L111 eAbstractionObserver]: Analyzing ICFG odd.cqvasr [2022-04-15 01:30:49,680 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:30:49,680 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:30:49,746 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:30:49,769 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:30:49,769 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:30:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:30:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 01:30:49,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:49,807 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:49,807 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -487068095, now seen corresponding path program 1 times [2022-04-15 01:30:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:49,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862838198] [2022-04-15 01:30:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {23#true} is VALID [2022-04-15 01:30:50,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:30:50,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:30:50,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:50,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {23#true} is VALID [2022-04-15 01:30:50,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:30:50,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:30:50,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:30:50,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 1) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {23#true} is VALID [2022-04-15 01:30:50,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [47] L13-3-->L13-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:30:50,035 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_5 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {24#false} is VALID [2022-04-15 01:30:50,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [53] __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] {24#false} is VALID [2022-04-15 01:30:50,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [55] 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[] {24#false} is VALID [2022-04-15 01:30:50,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:30:50,036 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-15 01:30:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:50,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862838198] [2022-04-15 01:30:50,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862838198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:30:50,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:30:50,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:30:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461695097] [2022-04-15 01:30:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:30:50,045 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-15 01:30:50,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:50,049 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-15 01:30:50,068 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-15 01:30:50,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:30:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:30:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:30:50,101 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,190 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 01:30:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:30:50,190 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-15 01:30:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:50,191 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-15 01:30:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 01:30:50,203 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-15 01:30:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 01:30:50,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 01:30:50,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:50,265 INFO L225 Difference]: With dead ends: 32 [2022-04-15 01:30:50,265 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:30:50,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:30:50,271 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:50,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:30:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:30:50,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:50,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,302 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,302 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,308 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:30:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:50,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:50,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:50,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:30:50,310 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:30:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,312 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:30:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:50,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:50,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:50,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:50,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:30:50,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 01:30:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:50,317 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:30:50,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:30:50,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:50,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:50,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:30:50,326 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2110189820, now seen corresponding path program 1 times [2022-04-15 01:30:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:50,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768868064] [2022-04-15 01:30:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {118#true} is VALID [2022-04-15 01:30:50,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:30:50,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:30:50,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:50,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {118#true} is VALID [2022-04-15 01:30:50,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:30:50,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:30:50,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:30:50,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 1) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,473 INFO L272 TraceCheckUtils]: 8: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_5 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:30:50,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(<= 1 |__VERIFIER_assert_#in~cond|)} [53] __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] {125#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:30:50,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#(<= 1 __VERIFIER_assert_~cond)} [55] 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[] {119#false} is VALID [2022-04-15 01:30:50,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:30:50,475 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-15 01:30:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:50,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768868064] [2022-04-15 01:30:50,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768868064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:30:50,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:30:50,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:30:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813002329] [2022-04-15 01:30:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:30:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-15 01:30:50,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:50,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-15 01:30:50,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:50,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:30:50,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:50,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:30:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:30:50,495 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-15 01:30:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,615 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 01:30:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:30:50,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-15 01:30:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-15 01:30:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 01:30:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-15 01:30:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 01:30:50,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 01:30:50,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:50,647 INFO L225 Difference]: With dead ends: 20 [2022-04-15 01:30:50,648 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 01:30:50,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:30:50,653 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:50,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 01:30:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 01:30:50,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:50,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,661 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,661 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,662 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:30:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:30:50,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:50,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:50,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:30:50,664 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:30:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:50,665 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:30:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:30:50,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:50,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:50,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:50,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 01:30:50,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 01:30:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:50,668 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 01:30:50,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-15 01:30:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:30:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 01:30:50,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:50,669 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:50,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:30:50,669 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1523776447, now seen corresponding path program 1 times [2022-04-15 01:30:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:50,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542284849] [2022-04-15 01:30:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {218#true} is VALID [2022-04-15 01:30:50,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:50,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {218#true} is VALID [2022-04-15 01:30:50,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 1) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} [51] L13-1-->L13-3: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:50,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:50,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:50,803 INFO L272 TraceCheckUtils]: 10: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_5 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:30:50,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} [53] __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] {226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:30:50,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 __VERIFIER_assert_~cond)} [55] 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[] {219#false} is VALID [2022-04-15 01:30:50,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 01:30:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:30:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542284849] [2022-04-15 01:30:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542284849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:30:50,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316920816] [2022-04-15 01:30:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:30:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:30:50,808 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-15 01:30:50,809 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-15 01:30:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 01:30:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:50,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:30:50,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {218#true} is VALID [2022-04-15 01:30:50,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:50,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 1) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 01:30:50,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} [51] L13-1-->L13-3: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {252#(= main_~x~0 3)} is VALID [2022-04-15 01:30:50,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(= main_~x~0 3)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {252#(= main_~x~0 3)} is VALID [2022-04-15 01:30:50,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(= main_~x~0 3)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {252#(= main_~x~0 3)} is VALID [2022-04-15 01:30:50,976 INFO L272 TraceCheckUtils]: 10: Hoare triple {252#(= main_~x~0 3)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_5 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {262#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-15 01:30:50,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(= |__VERIFIER_assert_#in~cond| 1)} [53] __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] {266#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-15 01:30:50,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(= __VERIFIER_assert_~cond 1)} [55] 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[] {219#false} is VALID [2022-04-15 01:30:50,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 01:30:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:30:50,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:30:51,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 01:30:51,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} [55] 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[] {219#false} is VALID [2022-04-15 01:30:51,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#(not (= |__VERIFIER_assert_#in~cond| 0))} [53] __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] {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:30:51,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= (mod v_main_~x~0_5 2) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {280#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:30:51,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:51,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:51,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [51] L13-1-->L13-3: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:51,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:51,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 1) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-15 01:30:51,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:51,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:51,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:51,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 2) 100) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= (select .cse1 1) 100) (= 111 (select .cse1 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] {218#true} is VALID [2022-04-15 01:30:51,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 01:30:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 01:30:51,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316920816] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:30:51,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:30:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 12 [2022-04-15 01:30:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114552866] [2022-04-15 01:30:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:30:51,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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 14 [2022-04-15 01:30:51,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:51,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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-15 01:30:51,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:51,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 01:30:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 01:30:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 01:30:51,148 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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-15 01:30:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:51,202 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:30:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:30:51,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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 14 [2022-04-15 01:30:51,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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-15 01:30:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-15 01:30:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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-15 01:30:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-15 01:30:51,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2022-04-15 01:30:51,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:51,221 INFO L225 Difference]: With dead ends: 15 [2022-04-15 01:30:51,221 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:30:51,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:30:51,224 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:51,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:30:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:30:51,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:51,227 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-15 01:30:51,227 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-15 01:30:51,227 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-15 01:30:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:51,227 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:30:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:30:51,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:51,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:51,228 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-15 01:30:51,228 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-15 01:30:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:51,228 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:30:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:30:51,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:51,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:51,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:51,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:51,229 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-15 01:30:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:30:51,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 01:30:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:51,229 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:30:51,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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-15 01:30:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:30:51,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:51,232 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:30:51,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 01:30:51,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:30:51,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:30:51,496 INFO L878 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-15 01:30:51,497 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:30:51,497 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:30:51,497 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:30:51,497 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:30:51,497 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:30:51,497 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:30:51,497 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2022-04-15 01:30:51,497 INFO L878 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0) [2022-04-15 01:30:51,498 INFO L878 garLoopResultBuilder]: At program point L13-4(lines 13 15) the Hoare annotation is: (<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0) [2022-04-15 01:30:51,498 INFO L882 garLoopResultBuilder]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2022-04-15 01:30:51,498 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:30:51,498 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2022-04-15 01:30:51,498 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2022-04-15 01:30:51,498 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 01:30:51,499 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-15 01:30:51,499 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 01:30:51,499 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-15 01:30:51,499 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-15 01:30:51,499 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-15 01:30:51,503 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 01:30:51,504 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:30:51,512 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:30:51,512 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 01:30:51,513 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:30:51,514 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-15 01:30:51,515 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:30:51,516 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:30:51,517 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:30:51,517 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:30:51,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:30:51 BasicIcfg [2022-04-15 01:30:51,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:30:51,526 INFO L158 Benchmark]: Toolchain (without parser) took 2387.49ms. Allocated memory was 175.1MB in the beginning and 234.9MB in the end (delta: 59.8MB). Free memory was 116.7MB in the beginning and 195.1MB in the end (delta: -78.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:30:51,526 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 120.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:30:51,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 175.1MB. Free memory was 116.6MB in the beginning and 146.5MB in the end (delta: -30.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2022-04-15 01:30:51,527 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 175.1MB. Free memory was 146.5MB in the beginning and 145.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:30:51,527 INFO L158 Benchmark]: RCFGBuilder took 249.88ms. Allocated memory is still 175.1MB. Free memory was 145.0MB in the beginning and 135.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 01:30:51,527 INFO L158 Benchmark]: IcfgTransformer took 41.60ms. Allocated memory is still 175.1MB. Free memory was 135.0MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:30:51,528 INFO L158 Benchmark]: TraceAbstraction took 1868.72ms. Allocated memory was 175.1MB in the beginning and 234.9MB in the end (delta: 59.8MB). Free memory was 132.9MB in the beginning and 195.1MB in the end (delta: -62.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:30:51,530 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.11ms. Allocated memory is still 175.1MB. Free memory was 132.8MB in the beginning and 132.7MB in the end (delta: 120.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 175.1MB. Free memory was 116.6MB in the beginning and 146.5MB in the end (delta: -30.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 175.1MB. Free memory was 146.5MB in the beginning and 145.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 249.88ms. Allocated memory is still 175.1MB. Free memory was 145.0MB in the beginning and 135.0MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 41.60ms. Allocated memory is still 175.1MB. Free memory was 135.0MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1868.72ms. Allocated memory was 175.1MB in the beginning and 234.9MB in the end (delta: 59.8MB). Free memory was 132.9MB in the beginning and 195.1MB in the end (delta: -62.2MB). There was no memory consumed. 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 29 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 SizeOfPredicates, 1 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 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: 13]: Loop Invariant Derived loop invariant: x / 2 * 2 + 1 <= x RESULT: Ultimate proved your program to be correct! [2022-04-15 01:30:51,561 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...