/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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:02:23,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:02:23,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:02:23,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:02:23,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:02:23,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:02:23,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:02:23,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:02:23,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:02:23,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:02:23,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:02:23,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:02:23,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:02:23,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:02:23,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:02:23,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:02:23,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:02:23,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:02:23,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:02:23,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:02:23,250 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:02:23,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:02:23,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:02:23,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:02:23,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:02:23,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:02:23,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:02:23,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:02:23,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:02:23,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:02:23,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:02:23,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:02:23,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:02:23,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:02:23,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:02:23,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:02:23,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:02:23,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:02:23,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:02:23,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:02:23,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:02:23,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:02:23,271 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 05:02:23,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:02:23,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:02:23,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 05:02:23,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 05:02:23,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 05:02:23,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 05:02:23,302 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 05:02:23,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:02:23,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:02:23,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:02:23,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:02:23,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:02:23,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:02:23,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:02:23,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:02:23,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 05:02:23,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 05:02:23,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 05:02:23,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 05:02:23,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:02:23,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 05:02:23,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 05:02:23,308 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 05:02:23,308 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 05:02:23,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:02:23,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:02:23,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:02:23,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:02:23,620 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:02:23,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-15 05:02:23,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d94de192/8f92f7ad8efc4e7a9cbb658a91ed29ff/FLAG15b78a893 [2022-04-15 05:02:24,128 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:02:24,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-15 05:02:24,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d94de192/8f92f7ad8efc4e7a9cbb658a91ed29ff/FLAG15b78a893 [2022-04-15 05:02:24,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d94de192/8f92f7ad8efc4e7a9cbb658a91ed29ff [2022-04-15 05:02:24,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:02:24,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 05:02:24,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:02:24,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:02:24,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:02:24,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e16279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24, skipping insertion in model container [2022-04-15 05:02:24,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:02:24,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:02:24,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-04-15 05:02:24,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:02:24,737 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:02:24,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-04-15 05:02:24,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:02:24,781 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:02:24,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24 WrapperNode [2022-04-15 05:02:24,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:02:24,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:02:24,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:02:24,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:02:24,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:02:24,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:02:24,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:02:24,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:02:24,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (1/1) ... [2022-04-15 05:02:24,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:02:24,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:02:24,864 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 05:02:24,866 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 05:02:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:02:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:02:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:02:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:02:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:02:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:02:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:02:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:02:24,959 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:02:24,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:02:25,125 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:02:25,132 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:02:25,132 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:02:25,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:25 BoogieIcfgContainer [2022-04-15 05:02:25,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:02:25,136 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 05:02:25,136 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 05:02:25,140 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 05:02:25,143 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:25" (1/1) ... [2022-04-15 05:02:25,145 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 05:02:25,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:02:25 BasicIcfg [2022-04-15 05:02:25,179 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 05:02:25,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:02:25,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:02:25,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:02:25,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:02:24" (1/4) ... [2022-04-15 05:02:25,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee16bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:02:25, skipping insertion in model container [2022-04-15 05:02:25,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:24" (2/4) ... [2022-04-15 05:02:25,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee16bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:02:25, skipping insertion in model container [2022-04-15 05:02:25,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:25" (3/4) ... [2022-04-15 05:02:25,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee16bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:02:25, skipping insertion in model container [2022-04-15 05:02:25,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:02:25" (4/4) ... [2022-04-15 05:02:25,186 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.cqvasr [2022-04-15 05:02:25,190 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:02:25,191 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:02:25,234 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:02:25,242 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 05:02:25,243 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:02:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:02:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:02:25,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:25,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:25,289 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash -655326661, now seen corresponding path program 1 times [2022-04-15 05:02:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:25,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917635093] [2022-04-15 05:02:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:25,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-15 05:02:25,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 05:02:25,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 05:02:25,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:25,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-15 05:02:25,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 05:02:25,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 05:02:25,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 05:02:25,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {33#true} is VALID [2022-04-15 05:02:25,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {33#true} is VALID [2022-04-15 05:02:25,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {33#true} is VALID [2022-04-15 05:02:25,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [131] L43-->L43-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} [141] L59-1-->L66: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {38#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:25,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} [143] L66-->L86-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 05:02:25,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 05:02:25,565 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 05:02:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:25,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917635093] [2022-04-15 05:02:25,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917635093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:25,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:25,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345026889] [2022-04-15 05:02:25,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:02:25,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:25,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:25,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:25,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:25,639 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:25,902 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-15 05:02:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:02:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:25,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 05:02:26,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,021 INFO L225 Difference]: With dead ends: 58 [2022-04-15 05:02:26,022 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 05:02:26,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:26,027 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:26,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:02:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 05:02:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-15 05:02:26,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:26,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,056 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,057 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,061 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-15 05:02:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-15 05:02:26,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 05:02:26,063 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 05:02:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,067 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-15 05:02:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-15 05:02:26,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:26,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-15 05:02:26,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-15 05:02:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:26,073 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-15 05:02:26,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-15 05:02:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:02:26,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:26,098 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:26,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:02:26,098 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1087483674, now seen corresponding path program 1 times [2022-04-15 05:02:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:26,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127454466] [2022-04-15 05:02:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {238#true} is VALID [2022-04-15 05:02:26,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-15 05:02:26,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-15 05:02:26,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:26,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {238#true} is VALID [2022-04-15 05:02:26,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-15 05:02:26,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-15 05:02:26,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-15 05:02:26,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {238#true} is VALID [2022-04-15 05:02:26,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {238#true} is VALID [2022-04-15 05:02:26,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {238#true} is VALID [2022-04-15 05:02:26,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {243#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:26,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= main_~p1~0 0)} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {243#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:26,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(= main_~p1~0 0)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {243#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:26,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#(= main_~p1~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {243#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:26,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(= main_~p1~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {243#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:26,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(= main_~p1~0 0)} [141] L59-1-->L66: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-15 05:02:26,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#false} [143] L66-->L86-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-15 05:02:26,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-15 05:02:26,189 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 05:02:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:26,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127454466] [2022-04-15 05:02:26,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127454466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:26,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:26,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23430985] [2022-04-15 05:02:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:26,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:02:26,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:26,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:26,211 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,377 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-15 05:02:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:02:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-15 05:02:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-15 05:02:26,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-15 05:02:26,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,488 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:02:26,488 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 05:02:26,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:26,490 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:26,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 05:02:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-15 05:02:26,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:26,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,497 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,497 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,500 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-15 05:02:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-15 05:02:26,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 05:02:26,501 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 05:02:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,504 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-15 05:02:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-15 05:02:26,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:26,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-15 05:02:26,507 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-15 05:02:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:26,507 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-15 05:02:26,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-15 05:02:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:02:26,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:26,509 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:26,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:02:26,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1159741911, now seen corresponding path program 1 times [2022-04-15 05:02:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:26,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150967569] [2022-04-15 05:02:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {462#true} is VALID [2022-04-15 05:02:26,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#true} is VALID [2022-04-15 05:02:26,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#true} is VALID [2022-04-15 05:02:26,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {462#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:26,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {462#true} is VALID [2022-04-15 05:02:26,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#true} is VALID [2022-04-15 05:02:26,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#true} is VALID [2022-04-15 05:02:26,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#true} is VALID [2022-04-15 05:02:26,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {462#true} is VALID [2022-04-15 05:02:26,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {462#true} is VALID [2022-04-15 05:02:26,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {462#true} is VALID [2022-04-15 05:02:26,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#true} [131] L43-->L43-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {467#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:26,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(not (= main_~p1~0 0))} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {467#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:26,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(not (= main_~p1~0 0))} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {467#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:26,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(not (= main_~p1~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {467#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:26,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(not (= main_~p1~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {467#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:26,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(not (= main_~p1~0 0))} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {463#false} is VALID [2022-04-15 05:02:26,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#false} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {463#false} is VALID [2022-04-15 05:02:26,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#false} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {463#false} is VALID [2022-04-15 05:02:26,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#false} is VALID [2022-04-15 05:02:26,599 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 05:02:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:26,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150967569] [2022-04-15 05:02:26,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150967569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:26,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:26,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048512711] [2022-04-15 05:02:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:26,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:26,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:26,617 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,719 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-15 05:02:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:26,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-15 05:02:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-15 05:02:26,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-15 05:02:26,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,803 INFO L225 Difference]: With dead ends: 64 [2022-04-15 05:02:26,803 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 05:02:26,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:26,805 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:26,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 05:02:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-15 05:02:26,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:26,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,811 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,811 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,813 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-15 05:02:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-15 05:02:26,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 05:02:26,815 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 05:02:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,817 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-15 05:02:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-15 05:02:26,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:26,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:26,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:26,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-15 05:02:26,820 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-15 05:02:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:26,820 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-15 05:02:26,821 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-15 05:02:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:02:26,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:26,821 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:26,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:02:26,822 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -647712552, now seen corresponding path program 1 times [2022-04-15 05:02:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:26,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224466786] [2022-04-15 05:02:26,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:26,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:26,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-15 05:02:26,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:26,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {693#true} is VALID [2022-04-15 05:02:26,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {693#true} is VALID [2022-04-15 05:02:26,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {693#true} is VALID [2022-04-15 05:02:26,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {693#true} is VALID [2022-04-15 05:02:26,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {693#true} is VALID [2022-04-15 05:02:26,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~lk2~0 1)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~lk2~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {698#(= main_~lk2~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {698#(= main_~lk2~0 1)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#(= main_~lk2~0 1)} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {698#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:26,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(= main_~lk2~0 1)} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-15 05:02:26,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#false} is VALID [2022-04-15 05:02:26,875 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 05:02:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:26,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224466786] [2022-04-15 05:02:26,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224466786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:26,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:26,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065557171] [2022-04-15 05:02:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:26,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:26,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:26,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:26,891 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:26,999 INFO L93 Difference]: Finished difference Result 77 states and 121 transitions. [2022-04-15 05:02:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 05:02:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 05:02:27,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-15 05:02:27,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,059 INFO L225 Difference]: With dead ends: 77 [2022-04-15 05:02:27,060 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 05:02:27,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:27,071 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:27,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 05:02:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-04-15 05:02:27,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:27,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,078 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,079 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,082 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2022-04-15 05:02:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-04-15 05:02:27,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 05:02:27,083 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 05:02:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,086 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2022-04-15 05:02:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-04-15 05:02:27,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:27,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 89 transitions. [2022-04-15 05:02:27,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 89 transitions. Word has length 17 [2022-04-15 05:02:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:27,090 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 89 transitions. [2022-04-15 05:02:27,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2022-04-15 05:02:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:02:27,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:27,096 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:27,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:02:27,097 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1095097783, now seen corresponding path program 1 times [2022-04-15 05:02:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:27,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151561108] [2022-04-15 05:02:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1009#true} is VALID [2022-04-15 05:02:27,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1009#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1009#true} {1009#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {1009#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:27,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1009#true} is VALID [2022-04-15 05:02:27,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1009#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {1009#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1009#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {1009#true} is VALID [2022-04-15 05:02:27,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {1009#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {1009#true} is VALID [2022-04-15 05:02:27,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {1009#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {1009#true} is VALID [2022-04-15 05:02:27,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1009#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1009#true} is VALID [2022-04-15 05:02:27,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1009#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1014#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:27,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {1014#(= main_~p2~0 0)} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1014#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:27,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1014#(= main_~p2~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1014#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:27,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1014#(= main_~p2~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1014#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:27,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {1014#(= main_~p2~0 0)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1014#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:27,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#(= main_~p2~0 0)} [145] L65-1-->L71: Formula: (not (= v_main_~p2~0_1 0)) InVars {main_~p2~0=v_main_~p2~0_1} OutVars{main_~p2~0=v_main_~p2~0_1} AuxVars[] AssignedVars[] {1010#false} is VALID [2022-04-15 05:02:27,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#false} [149] L71-->L86-1: Formula: (not (= v_main_~lk2~0_1 1)) InVars {main_~lk2~0=v_main_~lk2~0_1} OutVars{main_~lk2~0=v_main_~lk2~0_1} AuxVars[] AssignedVars[] {1010#false} is VALID [2022-04-15 05:02:27,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1010#false} is VALID [2022-04-15 05:02:27,175 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 05:02:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:27,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151561108] [2022-04-15 05:02:27,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151561108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:27,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:27,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873470779] [2022-04-15 05:02:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:27,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:27,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:27,193 INFO L87 Difference]: Start difference. First operand 57 states and 89 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,303 INFO L93 Difference]: Finished difference Result 125 states and 199 transitions. [2022-04-15 05:02:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:02:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:02:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:02:27,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 05:02:27,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,386 INFO L225 Difference]: With dead ends: 125 [2022-04-15 05:02:27,386 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 05:02:27,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:27,388 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:27,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 05:02:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-15 05:02:27,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:27,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,395 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,395 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,397 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2022-04-15 05:02:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2022-04-15 05:02:27,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 05:02:27,399 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 05:02:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,402 INFO L93 Difference]: Finished difference Result 77 states and 116 transitions. [2022-04-15 05:02:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2022-04-15 05:02:27,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:27,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-15 05:02:27,405 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-15 05:02:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:27,406 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-15 05:02:27,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-15 05:02:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:02:27,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:27,407 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:27,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 05:02:27,407 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779414, now seen corresponding path program 1 times [2022-04-15 05:02:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:27,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569379814] [2022-04-15 05:02:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {1405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1399#true} is VALID [2022-04-15 05:02:27,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1399#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1399#true} {1399#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {1399#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:27,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1399#true} is VALID [2022-04-15 05:02:27,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1399#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1399#true} {1399#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1399#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1399#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {1399#true} is VALID [2022-04-15 05:02:27,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {1399#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {1399#true} is VALID [2022-04-15 05:02:27,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {1399#true} is VALID [2022-04-15 05:02:27,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1399#true} is VALID [2022-04-15 05:02:27,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {1399#true} [133] L43-2-->L47-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {1404#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:27,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {1404#(not (= main_~p2~0 0))} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1404#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:27,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1404#(not (= main_~p2~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1404#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:27,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1404#(not (= main_~p2~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1404#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:27,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(not (= main_~p2~0 0))} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1404#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:27,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(not (= main_~p2~0 0))} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1400#false} is VALID [2022-04-15 05:02:27,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1400#false} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1400#false} is VALID [2022-04-15 05:02:27,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1400#false} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {1400#false} is VALID [2022-04-15 05:02:27,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {1400#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1400#false} is VALID [2022-04-15 05:02:27,452 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 05:02:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:27,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569379814] [2022-04-15 05:02:27,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569379814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:27,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:27,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580779324] [2022-04-15 05:02:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:27,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:27,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:27,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:27,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:27,467 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,563 INFO L93 Difference]: Finished difference Result 112 states and 170 transitions. [2022-04-15 05:02:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:27,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 05:02:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 05:02:27,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 05:02:27,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,647 INFO L225 Difference]: With dead ends: 112 [2022-04-15 05:02:27,647 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 05:02:27,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:27,649 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 65 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:27,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 05:02:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-15 05:02:27,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:27,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,655 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,656 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,658 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2022-04-15 05:02:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2022-04-15 05:02:27,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 05:02:27,659 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 05:02:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,662 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2022-04-15 05:02:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2022-04-15 05:02:27,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:27,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2022-04-15 05:02:27,665 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 18 [2022-04-15 05:02:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:27,665 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2022-04-15 05:02:27,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2022-04-15 05:02:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:02:27,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:27,666 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:27,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:02:27,667 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash -411675049, now seen corresponding path program 1 times [2022-04-15 05:02:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894000055] [2022-04-15 05:02:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1782#true} is VALID [2022-04-15 05:02:27,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1782#true} {1782#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {1782#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:27,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1782#true} is VALID [2022-04-15 05:02:27,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#true} {1782#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {1782#true} is VALID [2022-04-15 05:02:27,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {1782#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {1782#true} is VALID [2022-04-15 05:02:27,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {1782#true} is VALID [2022-04-15 05:02:27,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-15 05:02:27,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {1782#true} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#(= main_~lk3~0 1)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(= main_~lk3~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#(= main_~lk3~0 1)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#(= main_~lk3~0 1)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#(= main_~lk3~0 1)} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1787#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:27,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {1787#(= main_~lk3~0 1)} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-15 05:02:27,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {1783#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-15 05:02:27,711 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 05:02:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:27,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894000055] [2022-04-15 05:02:27,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894000055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:27,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:27,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989350441] [2022-04-15 05:02:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:27,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:27,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:27,727 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,831 INFO L93 Difference]: Finished difference Result 133 states and 201 transitions. [2022-04-15 05:02:27,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-15 05:02:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-15 05:02:27,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-15 05:02:27,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,886 INFO L225 Difference]: With dead ends: 133 [2022-04-15 05:02:27,886 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 05:02:27,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:27,887 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:27,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 05:02:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2022-04-15 05:02:27,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:27,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,895 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,896 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,899 INFO L93 Difference]: Finished difference Result 131 states and 196 transitions. [2022-04-15 05:02:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2022-04-15 05:02:27,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 05:02:27,901 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-15 05:02:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:27,904 INFO L93 Difference]: Finished difference Result 131 states and 196 transitions. [2022-04-15 05:02:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2022-04-15 05:02:27,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:27,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:27,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:27,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2022-04-15 05:02:27,908 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 18 [2022-04-15 05:02:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:27,909 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2022-04-15 05:02:27,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2022-04-15 05:02:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:02:27,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:27,910 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:27,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 05:02:27,910 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135286, now seen corresponding path program 1 times [2022-04-15 05:02:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:27,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670278565] [2022-04-15 05:02:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:27,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {2326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2320#true} is VALID [2022-04-15 05:02:27,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2320#true} {2320#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {2320#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:27,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2320#true} is VALID [2022-04-15 05:02:27,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {2320#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {2320#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {2320#true} is VALID [2022-04-15 05:02:27,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {2320#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {2320#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2320#true} is VALID [2022-04-15 05:02:27,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {2320#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {2325#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:27,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {2325#(= main_~p3~0 0)} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2325#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:27,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {2325#(= main_~p3~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2325#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:27,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {2325#(= main_~p3~0 0)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2325#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:27,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(= main_~p3~0 0)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2325#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:27,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {2325#(= main_~p3~0 0)} [151] L70-1-->L76: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2321#false} is VALID [2022-04-15 05:02:27,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#false} [153] L76-->L86-1: Formula: (not (= v_main_~lk3~0_2 1)) InVars {main_~lk3~0=v_main_~lk3~0_2} OutVars{main_~lk3~0=v_main_~lk3~0_2} AuxVars[] AssignedVars[] {2321#false} is VALID [2022-04-15 05:02:27,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2321#false} is VALID [2022-04-15 05:02:27,961 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 05:02:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670278565] [2022-04-15 05:02:27,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670278565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:27,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:27,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811421810] [2022-04-15 05:02:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:27,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:27,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:27,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:27,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:27,976 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,071 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2022-04-15 05:02:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:02:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-15 05:02:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-15 05:02:28,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-15 05:02:28,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,145 INFO L225 Difference]: With dead ends: 233 [2022-04-15 05:02:28,145 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 05:02:28,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:28,148 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:28,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 05:02:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-04-15 05:02:28,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:28,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,185 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,188 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,193 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-04-15 05:02:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-04-15 05:02:28,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 05:02:28,194 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 05:02:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,199 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-04-15 05:02:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-04-15 05:02:28,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:28,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2022-04-15 05:02:28,204 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 18 [2022-04-15 05:02:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:28,206 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2022-04-15 05:02:28,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2022-04-15 05:02:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:02:28,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:28,207 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:28,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 05:02:28,207 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash 123007539, now seen corresponding path program 1 times [2022-04-15 05:02:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:28,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773363784] [2022-04-15 05:02:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3014#true} is VALID [2022-04-15 05:02:28,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3014#true} {3014#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {3014#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:28,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {3020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3014#true} is VALID [2022-04-15 05:02:28,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {3014#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3014#true} {3014#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {3014#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {3014#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {3014#true} is VALID [2022-04-15 05:02:28,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {3014#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {3014#true} is VALID [2022-04-15 05:02:28,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {3014#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {3014#true} is VALID [2022-04-15 05:02:28,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {3014#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {3014#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3014#true} is VALID [2022-04-15 05:02:28,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {3014#true} [135] L47-1-->L51-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {3019#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:28,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {3019#(not (= main_~p3~0 0))} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3019#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:28,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(not (= main_~p3~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3019#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:28,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(not (= main_~p3~0 0))} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3019#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:28,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(not (= main_~p3~0 0))} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3019#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:28,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#(not (= main_~p3~0 0))} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3015#false} is VALID [2022-04-15 05:02:28,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3015#false} [155] L75-1-->L81: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3015#false} is VALID [2022-04-15 05:02:28,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {3015#false} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3015#false} is VALID [2022-04-15 05:02:28,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {3015#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#false} is VALID [2022-04-15 05:02:28,259 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 05:02:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773363784] [2022-04-15 05:02:28,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773363784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:28,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:28,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965442064] [2022-04-15 05:02:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:28,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:28,280 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,378 INFO L93 Difference]: Finished difference Result 205 states and 289 transitions. [2022-04-15 05:02:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:28,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:28,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 05:02:28,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,472 INFO L225 Difference]: With dead ends: 205 [2022-04-15 05:02:28,472 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 05:02:28,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:28,473 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:28,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 05:02:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-15 05:02:28,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:28,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,481 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,481 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,485 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-04-15 05:02:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2022-04-15 05:02:28,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-15 05:02:28,486 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 143 states. [2022-04-15 05:02:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,489 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-04-15 05:02:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2022-04-15 05:02:28,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:28,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2022-04-15 05:02:28,493 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 19 [2022-04-15 05:02:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:28,493 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2022-04-15 05:02:28,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2022-04-15 05:02:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:02:28,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:28,494 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:28,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 05:02:28,495 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1684446924, now seen corresponding path program 1 times [2022-04-15 05:02:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:28,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865315038] [2022-04-15 05:02:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {3698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3692#true} is VALID [2022-04-15 05:02:28,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {3692#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3692#true} {3692#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {3692#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:28,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {3698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3692#true} is VALID [2022-04-15 05:02:28,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {3692#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3692#true} {3692#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {3692#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {3692#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {3692#true} is VALID [2022-04-15 05:02:28,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {3692#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {3692#true} is VALID [2022-04-15 05:02:28,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3692#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {3692#true} is VALID [2022-04-15 05:02:28,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {3692#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3692#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {3692#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {3692#true} is VALID [2022-04-15 05:02:28,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {3692#true} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {3697#(= main_~lk4~0 1)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {3697#(= main_~lk4~0 1)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {3697#(= main_~lk4~0 1)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {3697#(= main_~lk4~0 1)} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {3697#(= main_~lk4~0 1)} [155] L75-1-->L81: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3697#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:28,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {3697#(= main_~lk4~0 1)} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3693#false} is VALID [2022-04-15 05:02:28,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {3693#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3693#false} is VALID [2022-04-15 05:02:28,550 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 05:02:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865315038] [2022-04-15 05:02:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865315038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:28,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467386677] [2022-04-15 05:02:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:28,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:28,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:28,565 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,659 INFO L93 Difference]: Finished difference Result 237 states and 329 transitions. [2022-04-15 05:02:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-15 05:02:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-15 05:02:28,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-15 05:02:28,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,724 INFO L225 Difference]: With dead ends: 237 [2022-04-15 05:02:28,725 INFO L226 Difference]: Without dead ends: 235 [2022-04-15 05:02:28,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:28,726 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:28,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-15 05:02:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-15 05:02:28,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:28,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,735 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,737 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,755 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2022-04-15 05:02:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2022-04-15 05:02:28,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-15 05:02:28,756 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-15 05:02:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,763 INFO L93 Difference]: Finished difference Result 235 states and 320 transitions. [2022-04-15 05:02:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2022-04-15 05:02:28,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:28,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2022-04-15 05:02:28,769 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 19 [2022-04-15 05:02:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:28,769 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2022-04-15 05:02:28,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2022-04-15 05:02:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:02:28,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:28,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:28,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 05:02:28,770 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:28,771 INFO L85 PathProgramCache]: Analyzing trace with hash 58363411, now seen corresponding path program 1 times [2022-04-15 05:02:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097391935] [2022-04-15 05:02:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:28,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {4656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4650#true} is VALID [2022-04-15 05:02:28,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {4650#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4650#true} {4650#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {4650#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:28,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {4656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4650#true} is VALID [2022-04-15 05:02:28,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {4650#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4650#true} {4650#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {4650#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {4650#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {4650#true} is VALID [2022-04-15 05:02:28,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {4650#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {4650#true} is VALID [2022-04-15 05:02:28,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {4650#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {4650#true} is VALID [2022-04-15 05:02:28,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {4650#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {4650#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {4650#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4650#true} is VALID [2022-04-15 05:02:28,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {4650#true} [138] L51-1-->L55-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {4655#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:28,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {4655#(= main_~p4~0 0)} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4655#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:28,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {4655#(= main_~p4~0 0)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4655#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:28,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {4655#(= main_~p4~0 0)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4655#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:28,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {4655#(= main_~p4~0 0)} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {4655#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:28,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {4655#(= main_~p4~0 0)} [155] L75-1-->L81: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {4651#false} is VALID [2022-04-15 05:02:28,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {4651#false} [157] L81-->L86-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {4651#false} is VALID [2022-04-15 05:02:28,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {4651#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4651#false} is VALID [2022-04-15 05:02:28,834 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 05:02:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:28,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097391935] [2022-04-15 05:02:28,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097391935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:28,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:28,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64924775] [2022-04-15 05:02:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:28,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:28,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:28,849 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,946 INFO L93 Difference]: Finished difference Result 445 states and 593 transitions. [2022-04-15 05:02:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-15 05:02:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-15 05:02:28,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-15 05:02:29,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:29,021 INFO L225 Difference]: With dead ends: 445 [2022-04-15 05:02:29,021 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 05:02:29,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:29,022 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:29,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 05:02:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-15 05:02:29,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:29,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,031 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,032 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,038 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2022-04-15 05:02:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 328 transitions. [2022-04-15 05:02:29,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 05:02:29,039 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 05:02:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,045 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2022-04-15 05:02:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 328 transitions. [2022-04-15 05:02:29,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:29,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 327 transitions. [2022-04-15 05:02:29,052 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 327 transitions. Word has length 19 [2022-04-15 05:02:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:29,052 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 327 transitions. [2022-04-15 05:02:29,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 327 transitions. [2022-04-15 05:02:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:29,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:29,053 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:29,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 05:02:29,054 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash -678214798, now seen corresponding path program 1 times [2022-04-15 05:02:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:29,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277585222] [2022-04-15 05:02:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {5942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5936#true} is VALID [2022-04-15 05:02:29,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5936#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5936#true} {5936#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {5936#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:29,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {5942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5936#true} is VALID [2022-04-15 05:02:29,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {5936#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5936#true} {5936#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {5936#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {5936#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {5936#true} is VALID [2022-04-15 05:02:29,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {5936#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {5936#true} is VALID [2022-04-15 05:02:29,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {5936#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {5936#true} is VALID [2022-04-15 05:02:29,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {5936#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {5936#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {5936#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {5936#true} is VALID [2022-04-15 05:02:29,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {5936#true} [137] L51-1-->L55-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {5941#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:29,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {5941#(not (= main_~p4~0 0))} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {5941#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:29,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {5941#(not (= main_~p4~0 0))} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5941#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:29,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {5941#(not (= main_~p4~0 0))} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {5941#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:29,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {5941#(not (= main_~p4~0 0))} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {5941#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:29,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {5941#(not (= main_~p4~0 0))} [156] L75-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {5937#false} is VALID [2022-04-15 05:02:29,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {5937#false} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {5937#false} is VALID [2022-04-15 05:02:29,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {5937#false} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {5937#false} is VALID [2022-04-15 05:02:29,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {5937#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5937#false} is VALID [2022-04-15 05:02:29,097 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 05:02:29,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277585222] [2022-04-15 05:02:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277585222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:29,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:29,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053202907] [2022-04-15 05:02:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:29,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,111 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 05:02:29,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:29,112 INFO L87 Difference]: Start difference. First operand 257 states and 327 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,221 INFO L93 Difference]: Finished difference Result 385 states and 485 transitions. [2022-04-15 05:02:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 05:02:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 05:02:29,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-15 05:02:29,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:29,290 INFO L225 Difference]: With dead ends: 385 [2022-04-15 05:02:29,290 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 05:02:29,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:29,292 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:29,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 05:02:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-15 05:02:29,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:29,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,300 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,301 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,307 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2022-04-15 05:02:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 328 transitions. [2022-04-15 05:02:29,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-15 05:02:29,308 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-15 05:02:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,314 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2022-04-15 05:02:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 328 transitions. [2022-04-15 05:02:29,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:29,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2022-04-15 05:02:29,322 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 20 [2022-04-15 05:02:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:29,323 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2022-04-15 05:02:29,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2022-04-15 05:02:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:29,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:29,324 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:29,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 05:02:29,324 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1809298035, now seen corresponding path program 1 times [2022-04-15 05:02:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:29,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126896355] [2022-04-15 05:02:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {7192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {7186#true} is VALID [2022-04-15 05:02:29,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {7186#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7186#true} {7186#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:29,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {7192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {7186#true} is VALID [2022-04-15 05:02:29,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {7186#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7186#true} {7186#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {7186#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {7186#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {7186#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {7186#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {7186#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {7186#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {7186#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {7186#true} [138] L51-1-->L55-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {7186#true} is VALID [2022-04-15 05:02:29,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#true} [139] L55-1-->L59-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {7191#(= main_~lk5~0 1)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {7191#(= main_~lk5~0 1)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {7191#(= main_~lk5~0 1)} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {7191#(= main_~lk5~0 1)} [156] L75-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {7191#(= main_~lk5~0 1)} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {7191#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:29,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {7191#(= main_~lk5~0 1)} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {7187#false} is VALID [2022-04-15 05:02:29,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {7187#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7187#false} is VALID [2022-04-15 05:02:29,396 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 05:02:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:29,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126896355] [2022-04-15 05:02:29,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126896355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:29,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:29,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055396851] [2022-04-15 05:02:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:29,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,410 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 05:02:29,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:29,412 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,510 INFO L93 Difference]: Finished difference Result 427 states and 520 transitions. [2022-04-15 05:02:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-15 05:02:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-15 05:02:29,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-15 05:02:29,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:29,562 INFO L225 Difference]: With dead ends: 427 [2022-04-15 05:02:29,562 INFO L226 Difference]: Without dead ends: 425 [2022-04-15 05:02:29,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:29,564 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:29,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-15 05:02:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-15 05:02:29,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:29,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,576 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,577 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,589 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-15 05:02:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2022-04-15 05:02:29,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-15 05:02:29,591 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 425 states. [2022-04-15 05:02:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,605 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2022-04-15 05:02:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 503 transitions. [2022-04-15 05:02:29,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:29,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 471 transitions. [2022-04-15 05:02:29,618 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 471 transitions. Word has length 20 [2022-04-15 05:02:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:29,618 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 471 transitions. [2022-04-15 05:02:29,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 471 transitions. [2022-04-15 05:02:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:29,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:29,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:29,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 05:02:29,625 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash -742858926, now seen corresponding path program 1 times [2022-04-15 05:02:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:29,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182209786] [2022-04-15 05:02:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:29,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {8935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8929#true} is VALID [2022-04-15 05:02:29,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {8929#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8929#true} {8929#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {8929#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:29,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {8935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8929#true} is VALID [2022-04-15 05:02:29,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {8929#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8929#true} {8929#true} [163] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {8929#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {8929#true} [122] mainENTRY-->L85-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p2~0_2 |v_main_#t~nondet5_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_4, main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~p2~0=v_main_~p2~0_2, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {8929#true} [126] L85-1-->L28: Formula: (and (= |v_main_#t~nondet9_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647)) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet9, main_~cond~0] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {8929#true} [129] L28-->L43: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {8929#true} [132] L43-->L43-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {8929#true} [134] L43-2-->L47-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {8929#true} [136] L47-1-->L51-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {8929#true} [138] L51-1-->L55-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {8929#true} is VALID [2022-04-15 05:02:29,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {8929#true} [140] L55-1-->L59-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {8934#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:29,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {8934#(= main_~p5~0 0)} [142] L59-1-->L65-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {8934#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:29,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {8934#(= main_~p5~0 0)} [146] L65-1-->L70-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {8934#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:29,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {8934#(= main_~p5~0 0)} [152] L70-1-->L75-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {8934#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:29,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {8934#(= main_~p5~0 0)} [156] L75-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {8934#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:29,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {8934#(= main_~p5~0 0)} [159] L80-1-->L86: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {8930#false} is VALID [2022-04-15 05:02:29,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {8930#false} [161] L86-->L86-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {8930#false} is VALID [2022-04-15 05:02:29,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {8930#false} [147] L86-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8930#false} is VALID [2022-04-15 05:02:29,674 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 05:02:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182209786] [2022-04-15 05:02:29,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182209786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:29,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:29,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488839115] [2022-04-15 05:02:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:29,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,687 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 05:02:29,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:29,688 INFO L87 Difference]: Start difference. First operand 393 states and 471 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,807 INFO L93 Difference]: Finished difference Result 857 states and 999 transitions. [2022-04-15 05:02:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 05:02:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 05:02:29,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-15 05:02:29,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:29,872 INFO L225 Difference]: With dead ends: 857 [2022-04-15 05:02:29,872 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:02:29,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:29,874 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:29,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:02:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:02:29,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:29,875 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 05:02:29,875 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 05:02:29,876 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 05:02:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:02:29,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:02:29,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,876 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 05:02:29,876 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 05:02:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:29,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:02:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:02:29,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:29,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:29,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:29,877 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 05:02:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:02:29,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-15 05:02:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:29,877 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:02:29,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:02:29,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:29,880 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:02:29,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 05:02:29,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:02:30,376 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 05:02:30,379 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:02:30,379 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:02:30,379 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:02:30,379 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-15 05:02:30,380 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-15 05:02:30,380 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 95) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 95) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,380 INFO L882 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-04-15 05:02:30,381 INFO L882 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,382 INFO L882 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-04-15 05:02:30,382 INFO L882 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2022-04-15 05:02:30,382 INFO L882 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-04-15 05:02:30,385 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:30,386 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 05:02:30,392 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-15 05:02:30,393 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-15 05:02:30,394 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-15 05:02:30,395 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 05:02:30,395 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-04-15 05:02:30,395 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 05:02:30,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:02:30 BasicIcfg [2022-04-15 05:02:30,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:02:30,401 INFO L158 Benchmark]: Toolchain (without parser) took 5859.51ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 125.4MB in the beginning and 153.9MB in the end (delta: -28.5MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,401 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:02:30,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.93ms. Allocated memory is still 173.0MB. Free memory was 125.2MB in the beginning and 151.3MB in the end (delta: -26.1MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,402 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 173.0MB. Free memory was 151.3MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,402 INFO L158 Benchmark]: RCFGBuilder took 313.36ms. Allocated memory is still 173.0MB. Free memory was 149.8MB in the beginning and 137.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,403 INFO L158 Benchmark]: IcfgTransformer took 43.19ms. Allocated memory is still 173.0MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,403 INFO L158 Benchmark]: TraceAbstraction took 5219.42ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 135.7MB in the beginning and 153.9MB in the end (delta: -18.3MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-04-15 05:02:30,404 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.15ms. Allocated memory is still 173.0MB. Free memory was 141.7MB in the beginning and 141.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.93ms. Allocated memory is still 173.0MB. Free memory was 125.2MB in the beginning and 151.3MB in the end (delta: -26.1MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 173.0MB. Free memory was 151.3MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.36ms. Allocated memory is still 173.0MB. Free memory was 149.8MB in the beginning and 137.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 43.19ms. Allocated memory is still 173.0MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5219.42ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 135.7MB in the beginning and 153.9MB in the end (delta: -18.3MB). Peak memory consumption was 101.7MB. 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: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 910 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 768 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 668 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:02:30,448 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...