/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:02:44,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:02:44,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:02:44,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:02:44,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:02:44,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:02:44,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:02:44,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:02:44,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:02:44,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:02:44,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:02:44,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:02:44,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:02:44,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:02:44,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:02:44,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:02:44,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:02:44,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:02:44,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:02:44,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:02:44,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:02:44,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:02:44,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:02:44,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:02:44,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:02:44,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:02:44,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:02:44,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:02:44,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:02:44,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:02:44,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:02:44,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:02:44,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:02:44,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:02:44,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:02:44,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:02:44,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:02:44,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:02:44,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:02:44,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:02:44,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:02:44,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:02:44,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 02:02:44,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:02:44,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:02:44,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 02:02:44,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 02:02:44,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 02:02:44,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 02:02:44,687 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 02:02:44,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:02:44,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:02:44,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:02:44,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:02:44,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:44,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:02:44,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 02:02:44,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 02:02:44,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 02:02:44,690 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-28 02:02:44,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:02:44,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:02:44,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:02:44,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:02:44,916 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:02:44,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 02:02:44,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd461311c/3058b00dc76b4fa68cf1885f48143941/FLAG95f684612 [2022-04-28 02:02:45,347 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:02:45,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 02:02:45,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd461311c/3058b00dc76b4fa68cf1885f48143941/FLAG95f684612 [2022-04-28 02:02:45,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd461311c/3058b00dc76b4fa68cf1885f48143941 [2022-04-28 02:02:45,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:02:45,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 02:02:45,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:45,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:02:45,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:02:45,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fefb0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45, skipping insertion in model container [2022-04-28 02:02:45,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:02:45,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:02:45,519 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_8.c[3218,3231] [2022-04-28 02:02:45,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:45,526 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:02:45,559 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_8.c[3218,3231] [2022-04-28 02:02:45,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:02:45,568 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:02:45,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45 WrapperNode [2022-04-28 02:02:45,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:02:45,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:02:45,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:02:45,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:02:45,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:02:45,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:02:45,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:02:45,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:02:45,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:02:45,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:02:45,634 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-28 02:02:45,651 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-28 02:02:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:02:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:02:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:02:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:02:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:02:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:02:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:02:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:02:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:02:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:02:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:02:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:02:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:02:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:02:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:02:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:02:45,730 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:02:45,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:02:45,927 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:02:45,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:02:45,939 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:02:45,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:45 BoogieIcfgContainer [2022-04-28 02:02:45,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:02:45,941 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 02:02:45,941 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 02:02:45,943 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 02:02:45,945 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:45" (1/1) ... [2022-04-28 02:02:45,948 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 02:02:45,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:45 BasicIcfg [2022-04-28 02:02:45,989 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 02:02:45,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:02:45,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:02:45,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:02:45,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:02:45" (1/4) ... [2022-04-28 02:02:45,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:45, skipping insertion in model container [2022-04-28 02:02:45,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:02:45" (2/4) ... [2022-04-28 02:02:45,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:02:45, skipping insertion in model container [2022-04-28 02:02:45,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:02:45" (3/4) ... [2022-04-28 02:02:45,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382d5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:02:45, skipping insertion in model container [2022-04-28 02:02:45,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:02:45" (4/4) ... [2022-04-28 02:02:45,995 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.cqvasr [2022-04-28 02:02:46,006 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:02:46,006 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:02:46,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:02:46,068 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d45830, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3dcf6d85 [2022-04-28 02:02:46,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:02:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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-28 02:02:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:02:46,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash -498315745, now seen corresponding path program 1 times [2022-04-28 02:02:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311533938] [2022-04-28 02:02:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {42#true} is VALID [2022-04-28 02:02:46,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-28 02:02:46,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-28 02:02:46,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {42#true} is VALID [2022-04-28 02:02:46,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-28 02:02:46,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-28 02:02:46,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-28 02:02:46,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {42#true} is VALID [2022-04-28 02:02:46,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {42#true} is VALID [2022-04-28 02:02:46,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {42#true} is VALID [2022-04-28 02:02:46,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [182] L58-->L58-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] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} [198] L86-1-->L93: 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[] {47#(= main_~lk1~0 1)} is VALID [2022-04-28 02:02:46,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} [200] L93-->L128-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[] {43#false} is VALID [2022-04-28 02:02:46,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-28 02:02:46,319 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-28 02:02:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311533938] [2022-04-28 02:02:46,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311533938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593923317] [2022-04-28 02:02:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,329 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-28 02:02:46,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,334 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-28 02:02:46,373 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-28 02:02:46,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:46,392 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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 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-28 02:02:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,693 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-28 02:02:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:46,693 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-28 02:02:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:46,694 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-28 02:02:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:02:46,702 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-28 02:02:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 02:02:46,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 02:02:46,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:46,821 INFO L225 Difference]: With dead ends: 76 [2022-04-28 02:02:46,821 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 02:02:46,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:46,827 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:46,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:02:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 02:02:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-28 02:02:46,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:46,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-28 02:02:46,864 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-28 02:02:46,865 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-28 02:02:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,878 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 02:02:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 02:02:46,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-28 02:02:46,882 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-28 02:02:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:46,886 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 02:02:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 02:02:46,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:46,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:46,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:46,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-28 02:02:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-28 02:02:46,890 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-28 02:02:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:46,890 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-28 02:02:46,890 INFO L496 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-28 02:02:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-28 02:02:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:02:46,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:46,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:46,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:02:46,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1999700192, now seen corresponding path program 1 times [2022-04-28 02:02:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:46,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443241216] [2022-04-28 02:02:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:46,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {313#true} is VALID [2022-04-28 02:02:46,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-28 02:02:46,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-28 02:02:46,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:46,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {313#true} is VALID [2022-04-28 02:02:46,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-28 02:02:46,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-28 02:02:46,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-28 02:02:46,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {313#true} is VALID [2022-04-28 02:02:46,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {313#true} is VALID [2022-04-28 02:02:46,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {313#true} is VALID [2022-04-28 02:02:46,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} [183] L58-->L58-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[] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(= main_~p1~0 0)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(= main_~p1~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#(= main_~p1~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#(= main_~p1~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#(= main_~p1~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#(= main_~p1~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {318#(= main_~p1~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {318#(= main_~p1~0 0)} is VALID [2022-04-28 02:02:46,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {318#(= main_~p1~0 0)} [198] L86-1-->L93: 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[] {314#false} is VALID [2022-04-28 02:02:46,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#false} [200] L93-->L128-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[] {314#false} is VALID [2022-04-28 02:02:46,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-28 02:02:46,986 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-28 02:02:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:46,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443241216] [2022-04-28 02:02:46,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443241216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:46,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:46,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79494838] [2022-04-28 02:02:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:46,988 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-28 02:02:46,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:46,989 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-28 02:02:47,001 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-28 02:02:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:47,007 INFO L87 Difference]: Start difference. First operand 43 states and 74 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-28 02:02:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,163 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-28 02:02:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:47,163 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-28 02:02:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:47,164 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-28 02:02:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 02:02:47,168 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-28 02:02:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 02:02:47,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 02:02:47,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:47,290 INFO L225 Difference]: With dead ends: 98 [2022-04-28 02:02:47,291 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 02:02:47,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:47,293 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:47,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 02:02:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-28 02:02:47,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:47,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-28 02:02:47,304 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-28 02:02:47,304 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-28 02:02:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,307 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 02:02:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 02:02:47,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-28 02:02:47,309 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-28 02:02:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,314 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 02:02:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 02:02:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:47,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-28 02:02:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-28 02:02:47,321 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-28 02:02:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:47,322 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-28 02:02:47,322 INFO L496 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-28 02:02:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-28 02:02:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:47,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:47,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:02:47,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1732113068, now seen corresponding path program 1 times [2022-04-28 02:02:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:47,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646650700] [2022-04-28 02:02:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {621#true} is VALID [2022-04-28 02:02:47,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-28 02:02:47,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-28 02:02:47,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {621#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:47,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {621#true} is VALID [2022-04-28 02:02:47,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-28 02:02:47,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-28 02:02:47,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {621#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-28 02:02:47,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {621#true} is VALID [2022-04-28 02:02:47,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {621#true} is VALID [2022-04-28 02:02:47,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {621#true} is VALID [2022-04-28 02:02:47,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#true} [182] L58-->L58-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] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(not (= main_~p1~0 0))} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(not (= main_~p1~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(not (= main_~p1~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(not (= main_~p1~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(not (= main_~p1~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(not (= main_~p1~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#(not (= main_~p1~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-28 02:02:47,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#(not (= main_~p1~0 0))} [199] L86-1-->L92-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[] {622#false} is VALID [2022-04-28 02:02:47,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#false} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-28 02:02:47,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {622#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-28 02:02:47,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {622#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-28 02:02:47,413 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-28 02:02:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:47,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646650700] [2022-04-28 02:02:47,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646650700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:47,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:47,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737811344] [2022-04-28 02:02:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:47,414 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-28 02:02:47,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:47,415 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-28 02:02:47,425 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-28 02:02:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:47,426 INFO L87 Difference]: Start difference. First operand 59 states and 102 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-28 02:02:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,574 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-28 02:02:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:47,575 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-28 02:02:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:47,575 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-28 02:02:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:02:47,586 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-28 02:02:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 02:02:47,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 02:02:47,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:47,696 INFO L225 Difference]: With dead ends: 91 [2022-04-28 02:02:47,696 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 02:02:47,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:47,697 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:47,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 02:02:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-28 02:02:47,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:47,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-28 02:02:47,702 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-28 02:02:47,702 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-28 02:02:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,703 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 02:02:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 02:02:47,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-28 02:02:47,704 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-28 02:02:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,706 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 02:02:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 02:02:47,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:47,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-28 02:02:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-28 02:02:47,708 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-28 02:02:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:47,708 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-28 02:02:47,708 INFO L496 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-28 02:02:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-28 02:02:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:47,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:47,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:47,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:02:47,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1861195787, now seen corresponding path program 1 times [2022-04-28 02:02:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:47,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820297805] [2022-04-28 02:02:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {933#true} is VALID [2022-04-28 02:02:47,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-28 02:02:47,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-28 02:02:47,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {933#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:47,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {933#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {933#true} is VALID [2022-04-28 02:02:47,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {933#true} is VALID [2022-04-28 02:02:47,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {933#true} [183] L58-->L58-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[] {933#true} is VALID [2022-04-28 02:02:47,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#(= main_~lk2~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(= main_~lk2~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(= main_~lk2~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(= main_~lk2~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#(= main_~lk2~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#(= main_~lk2~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(= main_~lk2~0 1)} [199] L86-1-->L92-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[] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {938#(= main_~lk2~0 1)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {938#(= main_~lk2~0 1)} is VALID [2022-04-28 02:02:47,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {938#(= main_~lk2~0 1)} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-28 02:02:47,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-28 02:02:47,753 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-28 02:02:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:47,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820297805] [2022-04-28 02:02:47,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820297805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:47,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:47,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078935618] [2022-04-28 02:02:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:47,754 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-28 02:02:47,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:47,754 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-28 02:02:47,765 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-28 02:02:47,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:47,767 INFO L87 Difference]: Start difference. First operand 62 states and 104 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-28 02:02:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,879 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2022-04-28 02:02:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:47,879 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-28 02:02:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:47,880 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-28 02:02:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 02:02:47,881 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-28 02:02:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 02:02:47,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 02:02:47,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:47,948 INFO L225 Difference]: With dead ends: 113 [2022-04-28 02:02:47,949 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 02:02:47,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:47,950 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:47,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 02:02:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2022-04-28 02:02:47,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:47,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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-28 02:02:47,955 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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-28 02:02:47,955 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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-28 02:02:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,957 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-28 02:02:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-28 02:02:47,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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 111 states. [2022-04-28 02:02:47,958 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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 111 states. [2022-04-28 02:02:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:47,961 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-28 02:02:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-28 02:02:47,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:47,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:47,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:47,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 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-28 02:02:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 137 transitions. [2022-04-28 02:02:47,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 137 transitions. Word has length 20 [2022-04-28 02:02:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:47,964 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 137 transitions. [2022-04-28 02:02:47,964 INFO L496 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-28 02:02:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 137 transitions. [2022-04-28 02:02:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:02:47,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:47,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:47,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:02:47,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 64244428, now seen corresponding path program 1 times [2022-04-28 02:02:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780904318] [2022-04-28 02:02:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1381#true} is VALID [2022-04-28 02:02:48,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-28 02:02:48,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-28 02:02:48,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:48,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1381#true} is VALID [2022-04-28 02:02:48,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-28 02:02:48,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-28 02:02:48,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-28 02:02:48,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1381#true} is VALID [2022-04-28 02:02:48,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {1381#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1381#true} is VALID [2022-04-28 02:02:48,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {1381#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1381#true} is VALID [2022-04-28 02:02:48,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1381#true} [183] L58-->L58-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[] {1381#true} is VALID [2022-04-28 02:02:48,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1381#true} [185] L58-2-->L62-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[] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1386#(= main_~p2~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#(= main_~p2~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1386#(= main_~p2~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1386#(= main_~p2~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {1386#(= main_~p2~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(= main_~p2~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(= main_~p2~0 0)} [199] L86-1-->L92-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[] {1386#(= main_~p2~0 0)} is VALID [2022-04-28 02:02:48,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(= main_~p2~0 0)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-28 02:02:48,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {1382#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-28 02:02:48,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-28 02:02:48,006 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-28 02:02:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:48,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780904318] [2022-04-28 02:02:48,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780904318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:48,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:48,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633016716] [2022-04-28 02:02:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:48,007 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-28 02:02:48,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:48,007 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-28 02:02:48,017 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-28 02:02:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:48,018 INFO L87 Difference]: Start difference. First operand 81 states and 137 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-28 02:02:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,131 INFO L93 Difference]: Finished difference Result 185 states and 319 transitions. [2022-04-28 02:02:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:48,131 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-28 02:02:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:48,133 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-28 02:02:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 02:02:48,134 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-28 02:02:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-28 02:02:48,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-28 02:02:48,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,234 INFO L225 Difference]: With dead ends: 185 [2022-04-28 02:02:48,234 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 02:02:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:48,235 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 02:02:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-28 02:02:48,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:48,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-28 02:02:48,240 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-28 02:02:48,241 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-28 02:02:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,243 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-28 02:02:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-28 02:02:48,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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 113 states. [2022-04-28 02:02:48,244 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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 113 states. [2022-04-28 02:02:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,246 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-28 02:02:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-28 02:02:48,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:48,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-28 02:02:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-28 02:02:48,250 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-28 02:02:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:48,250 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-28 02:02:48,250 INFO L496 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-28 02:02:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-28 02:02:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:48,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:48,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:48,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:02:48,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1862526652, now seen corresponding path program 1 times [2022-04-28 02:02:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:48,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116359235] [2022-04-28 02:02:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1939#true} is VALID [2022-04-28 02:02:48,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-28 02:02:48,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-28 02:02:48,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:48,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {1939#true} is VALID [2022-04-28 02:02:48,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1939#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1939#true} is VALID [2022-04-28 02:02:48,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#true} [183] L58-->L58-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[] {1939#true} is VALID [2022-04-28 02:02:48,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {1939#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#(not (= main_~p2~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#(not (= main_~p2~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(not (= main_~p2~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(not (= main_~p2~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(not (= main_~p2~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#(not (= main_~p2~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(not (= main_~p2~0 0))} [199] L86-1-->L92-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[] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-28 02:02:48,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(not (= main_~p2~0 0))} [203] L92-1-->L97-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[] {1940#false} is VALID [2022-04-28 02:02:48,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#false} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-28 02:02:48,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-28 02:02:48,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-28 02:02:48,304 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-28 02:02:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116359235] [2022-04-28 02:02:48,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116359235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:48,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:48,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879162081] [2022-04-28 02:02:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:48,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:48,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:48,317 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,422 INFO L93 Difference]: Finished difference Result 166 states and 278 transitions. [2022-04-28 02:02:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:48,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:02:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 02:02:48,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 02:02:48,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,512 INFO L225 Difference]: With dead ends: 166 [2022-04-28 02:02:48,512 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 02:02:48,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:48,513 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:48,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 02:02:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-04-28 02:02:48,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:48,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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-28 02:02:48,519 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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-28 02:02:48,519 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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-28 02:02:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,521 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-28 02:02:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-28 02:02:48,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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 115 states. [2022-04-28 02:02:48,522 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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 115 states. [2022-04-28 02:02:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,525 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-28 02:02:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-28 02:02:48,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:48,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 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-28 02:02:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 187 transitions. [2022-04-28 02:02:48,528 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 187 transitions. Word has length 21 [2022-04-28 02:02:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:48,528 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 187 transitions. [2022-04-28 02:02:48,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 187 transitions. [2022-04-28 02:02:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:48,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:48,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:48,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:02:48,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1991609371, now seen corresponding path program 1 times [2022-04-28 02:02:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:48,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392237276] [2022-04-28 02:02:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2484#true} is VALID [2022-04-28 02:02:48,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-28 02:02:48,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-28 02:02:48,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {2484#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2484#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2484#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {2484#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {2484#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {2484#true} is VALID [2022-04-28 02:02:48,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {2484#true} [183] L58-->L58-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[] {2484#true} is VALID [2022-04-28 02:02:48,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {2484#true} [185] L58-2-->L62-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[] {2484#true} is VALID [2022-04-28 02:02:48,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#(= main_~lk3~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#(= main_~lk3~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#(= main_~lk3~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#(= main_~lk3~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#(= main_~lk3~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {2489#(= main_~lk3~0 1)} [199] L86-1-->L92-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[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {2489#(= main_~lk3~0 1)} [203] L92-1-->L97-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[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#(= main_~lk3~0 1)} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-28 02:02:48,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#(= main_~lk3~0 1)} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-28 02:02:48,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {2485#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-28 02:02:48,579 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-28 02:02:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392237276] [2022-04-28 02:02:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392237276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195088392] [2022-04-28 02:02:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:48,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:48,592 INFO L87 Difference]: Start difference. First operand 113 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,702 INFO L93 Difference]: Finished difference Result 205 states and 345 transitions. [2022-04-28 02:02:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:02:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 02:02:48,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 02:02:48,764 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-28 02:02:48,767 INFO L225 Difference]: With dead ends: 205 [2022-04-28 02:02:48,767 INFO L226 Difference]: Without dead ends: 203 [2022-04-28 02:02:48,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:48,770 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:48,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-28 02:02:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2022-04-28 02:02:48,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:48,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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-28 02:02:48,784 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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-28 02:02:48,784 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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-28 02:02:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,789 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-28 02:02:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-28 02:02:48,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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 203 states. [2022-04-28 02:02:48,790 INFO L87 Difference]: Start difference. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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 203 states. [2022-04-28 02:02:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,794 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-28 02:02:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-28 02:02:48,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:48,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:48,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:48,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 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-28 02:02:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 251 transitions. [2022-04-28 02:02:48,807 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 251 transitions. Word has length 21 [2022-04-28 02:02:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:48,807 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 251 transitions. [2022-04-28 02:02:48,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 251 transitions. [2022-04-28 02:02:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:02:48,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:48,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 02:02:48,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 194658012, now seen corresponding path program 1 times [2022-04-28 02:02:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347793481] [2022-04-28 02:02:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:48,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {3286#true} is VALID [2022-04-28 02:02:48,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-28 02:02:48,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-28 02:02:48,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {3286#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:48,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {3286#true} is VALID [2022-04-28 02:02:48,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-28 02:02:48,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-28 02:02:48,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {3286#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-28 02:02:48,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {3286#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3286#true} is VALID [2022-04-28 02:02:48,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {3286#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {3286#true} is VALID [2022-04-28 02:02:48,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {3286#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {3286#true} is VALID [2022-04-28 02:02:48,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {3286#true} [183] L58-->L58-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[] {3286#true} is VALID [2022-04-28 02:02:48,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {3286#true} [185] L58-2-->L62-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[] {3286#true} is VALID [2022-04-28 02:02:48,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {3286#true} [187] L62-1-->L66-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[] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {3291#(= main_~p3~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {3291#(= main_~p3~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {3291#(= main_~p3~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {3291#(= main_~p3~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(= main_~p3~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3291#(= main_~p3~0 0)} [199] L86-1-->L92-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[] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {3291#(= main_~p3~0 0)} [203] L92-1-->L97-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[] {3291#(= main_~p3~0 0)} is VALID [2022-04-28 02:02:48,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {3291#(= main_~p3~0 0)} [208] L97-1-->L103: Formula: (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} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-28 02:02:48,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {3287#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-28 02:02:48,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {3287#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-28 02:02:48,864 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-28 02:02:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:48,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347793481] [2022-04-28 02:02:48,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347793481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:48,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:48,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561709233] [2022-04-28 02:02:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:48,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:48,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:48,880 INFO L87 Difference]: Start difference. First operand 153 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:48,992 INFO L93 Difference]: Finished difference Result 353 states and 585 transitions. [2022-04-28 02:02:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:02:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 02:02:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 02:02:48,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-28 02:02:49,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,088 INFO L225 Difference]: With dead ends: 353 [2022-04-28 02:02:49,088 INFO L226 Difference]: Without dead ends: 211 [2022-04-28 02:02:49,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:49,089 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:49,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-28 02:02:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-04-28 02:02:49,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:49,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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-28 02:02:49,094 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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-28 02:02:49,095 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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-28 02:02:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,099 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-28 02:02:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-28 02:02:49,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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 211 states. [2022-04-28 02:02:49,101 INFO L87 Difference]: Start difference. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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 211 states. [2022-04-28 02:02:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,105 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-28 02:02:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-28 02:02:49,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:49,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 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-28 02:02:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 339 transitions. [2022-04-28 02:02:49,109 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 339 transitions. Word has length 21 [2022-04-28 02:02:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:49,110 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 339 transitions. [2022-04-28 02:02:49,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-28 02:02:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 339 transitions. [2022-04-28 02:02:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:49,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:49,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:49,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 02:02:49,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1610380584, now seen corresponding path program 1 times [2022-04-28 02:02:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:49,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712420971] [2022-04-28 02:02:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {4316#true} is VALID [2022-04-28 02:02:49,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-28 02:02:49,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-28 02:02:49,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:49,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {4316#true} is VALID [2022-04-28 02:02:49,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-28 02:02:49,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-28 02:02:49,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {4316#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {4316#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {4316#true} [183] L58-->L58-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[] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {4316#true} [185] L58-2-->L62-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[] {4316#true} is VALID [2022-04-28 02:02:49,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {4316#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {4321#(not (= main_~p3~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {4321#(not (= main_~p3~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {4321#(not (= main_~p3~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {4321#(not (= main_~p3~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {4321#(not (= main_~p3~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {4321#(not (= main_~p3~0 0))} [199] L86-1-->L92-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[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {4321#(not (= main_~p3~0 0))} [203] L92-1-->L97-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[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-28 02:02:49,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {4321#(not (= main_~p3~0 0))} [209] L97-1-->L102-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[] {4317#false} is VALID [2022-04-28 02:02:49,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-28 02:02:49,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-28 02:02:49,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-28 02:02:49,144 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-28 02:02:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:49,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712420971] [2022-04-28 02:02:49,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712420971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:49,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:49,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604390315] [2022-04-28 02:02:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:49,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:49,157 INFO L87 Difference]: Start difference. First operand 209 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,263 INFO L93 Difference]: Finished difference Result 313 states and 505 transitions. [2022-04-28 02:02:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 02:02:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 02:02:49,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-28 02:02:49,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,349 INFO L225 Difference]: With dead ends: 313 [2022-04-28 02:02:49,350 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 02:02:49,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:49,350 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:49,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 02:02:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-28 02:02:49,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:49,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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-28 02:02:49,355 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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-28 02:02:49,355 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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-28 02:02:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,359 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-28 02:02:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-28 02:02:49,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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 215 states. [2022-04-28 02:02:49,360 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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 215 states. [2022-04-28 02:02:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,363 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-28 02:02:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-28 02:02:49,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:49,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 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-28 02:02:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2022-04-28 02:02:49,367 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 22 [2022-04-28 02:02:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:49,367 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2022-04-28 02:02:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2022-04-28 02:02:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:49,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:49,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:49,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:02:49,368 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1739463303, now seen corresponding path program 1 times [2022-04-28 02:02:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706877236] [2022-04-28 02:02:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {5318#true} is VALID [2022-04-28 02:02:49,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-28 02:02:49,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-28 02:02:49,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {5318#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:49,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {5318#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {5318#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {5318#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {5318#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {5318#true} [183] L58-->L58-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[] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {5318#true} [185] L58-2-->L62-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[] {5318#true} is VALID [2022-04-28 02:02:49,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {5318#true} [187] L62-1-->L66-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[] {5318#true} is VALID [2022-04-28 02:02:49,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {5318#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {5323#(= main_~lk4~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {5323#(= main_~lk4~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {5323#(= main_~lk4~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {5323#(= main_~lk4~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {5323#(= main_~lk4~0 1)} [199] L86-1-->L92-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[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {5323#(= main_~lk4~0 1)} [203] L92-1-->L97-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[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(= main_~lk4~0 1)} [209] L97-1-->L102-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[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {5323#(= main_~lk4~0 1)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-28 02:02:49,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {5323#(= main_~lk4~0 1)} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-28 02:02:49,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {5319#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-28 02:02:49,402 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-28 02:02:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706877236] [2022-04-28 02:02:49,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706877236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:49,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:49,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887010857] [2022-04-28 02:02:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:49,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:49,414 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,524 INFO L93 Difference]: Finished difference Result 381 states and 617 transitions. [2022-04-28 02:02:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 02:02:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 02:02:49,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 02:02:49,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,586 INFO L225 Difference]: With dead ends: 381 [2022-04-28 02:02:49,587 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 02:02:49,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:49,587 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:49,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 02:02:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-28 02:02:49,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:49,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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-28 02:02:49,593 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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-28 02:02:49,594 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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-28 02:02:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,600 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-28 02:02:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-28 02:02:49,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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 379 states. [2022-04-28 02:02:49,602 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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 379 states. [2022-04-28 02:02:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,608 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-28 02:02:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-28 02:02:49,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:49,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 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-28 02:02:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 463 transitions. [2022-04-28 02:02:49,614 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 463 transitions. Word has length 22 [2022-04-28 02:02:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:49,614 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 463 transitions. [2022-04-28 02:02:49,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 463 transitions. [2022-04-28 02:02:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 02:02:49,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:49,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 02:02:49,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash -57488056, now seen corresponding path program 1 times [2022-04-28 02:02:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:49,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370044539] [2022-04-28 02:02:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {6804#true} is VALID [2022-04-28 02:02:49,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-28 02:02:49,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-28 02:02:49,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:49,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {6804#true} is VALID [2022-04-28 02:02:49,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-28 02:02:49,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-28 02:02:49,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-28 02:02:49,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6804#true} is VALID [2022-04-28 02:02:49,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {6804#true} is VALID [2022-04-28 02:02:49,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {6804#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {6804#true} is VALID [2022-04-28 02:02:49,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {6804#true} [183] L58-->L58-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[] {6804#true} is VALID [2022-04-28 02:02:49,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {6804#true} [185] L58-2-->L62-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[] {6804#true} is VALID [2022-04-28 02:02:49,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {6804#true} [187] L62-1-->L66-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[] {6804#true} is VALID [2022-04-28 02:02:49,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {6804#true} [189] L66-1-->L70-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[] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#(= main_~p4~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#(= main_~p4~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#(= main_~p4~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#(= main_~p4~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#(= main_~p4~0 0)} [199] L86-1-->L92-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[] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {6809#(= main_~p4~0 0)} [203] L92-1-->L97-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[] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {6809#(= main_~p4~0 0)} [209] L97-1-->L102-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[] {6809#(= main_~p4~0 0)} is VALID [2022-04-28 02:02:49,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {6809#(= main_~p4~0 0)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-28 02:02:49,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {6805#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-28 02:02:49,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {6805#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-28 02:02:49,659 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-28 02:02:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:49,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370044539] [2022-04-28 02:02:49,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370044539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:49,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:49,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982579056] [2022-04-28 02:02:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:49,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:49,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:49,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:49,671 INFO L87 Difference]: Start difference. First operand 297 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,784 INFO L93 Difference]: Finished difference Result 685 states and 1073 transitions. [2022-04-28 02:02:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 02:02:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 02:02:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 02:02:49,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 02:02:49,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,879 INFO L225 Difference]: With dead ends: 685 [2022-04-28 02:02:49,879 INFO L226 Difference]: Without dead ends: 403 [2022-04-28 02:02:49,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:49,880 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:49,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-28 02:02:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-28 02:02:49,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:49,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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-28 02:02:49,888 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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-28 02:02:49,888 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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-28 02:02:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,896 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-28 02:02:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-28 02:02:49,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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 403 states. [2022-04-28 02:02:49,897 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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 403 states. [2022-04-28 02:02:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:49,905 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-28 02:02:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-28 02:02:49,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:49,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:49,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:49,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 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-28 02:02:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 615 transitions. [2022-04-28 02:02:49,913 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 615 transitions. Word has length 22 [2022-04-28 02:02:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:49,913 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 615 transitions. [2022-04-28 02:02:49,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-28 02:02:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 615 transitions. [2022-04-28 02:02:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:49,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:49,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:49,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 02:02:49,914 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1911180104, now seen corresponding path program 1 times [2022-04-28 02:02:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:49,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192879716] [2022-04-28 02:02:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:49,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {8762#true} is VALID [2022-04-28 02:02:49,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-28 02:02:49,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {8762#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:49,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {8762#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {8762#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8762#true} is VALID [2022-04-28 02:02:49,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {8762#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {8762#true} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {8762#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {8762#true} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {8762#true} [183] L58-->L58-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[] {8762#true} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8762#true} [185] L58-2-->L62-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[] {8762#true} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {8762#true} [187] L62-1-->L66-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[] {8762#true} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {8762#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {8767#(not (= main_~p4~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {8767#(not (= main_~p4~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {8767#(not (= main_~p4~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {8767#(not (= main_~p4~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {8767#(not (= main_~p4~0 0))} [199] L86-1-->L92-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[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {8767#(not (= main_~p4~0 0))} [203] L92-1-->L97-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[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {8767#(not (= main_~p4~0 0))} [209] L97-1-->L102-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[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {8767#(not (= main_~p4~0 0))} [213] L102-1-->L107-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[] {8763#false} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {8763#false} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {8763#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-28 02:02:49,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {8763#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-28 02:02:49,943 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-28 02:02:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:49,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192879716] [2022-04-28 02:02:49,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192879716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:49,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:49,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028337646] [2022-04-28 02:02:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:49,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:49,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:49,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:49,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:49,957 INFO L87 Difference]: Start difference. First operand 401 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,072 INFO L93 Difference]: Finished difference Result 601 states and 917 transitions. [2022-04-28 02:02:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:50,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 02:02:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 02:02:50,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-28 02:02:50,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:50,161 INFO L225 Difference]: With dead ends: 601 [2022-04-28 02:02:50,161 INFO L226 Difference]: Without dead ends: 411 [2022-04-28 02:02:50,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:50,162 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:50,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-28 02:02:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-28 02:02:50,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:50,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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-28 02:02:50,170 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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-28 02:02:50,170 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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-28 02:02:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,178 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-28 02:02:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-28 02:02:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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 411 states. [2022-04-28 02:02:50,179 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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 411 states. [2022-04-28 02:02:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,195 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-28 02:02:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-28 02:02:50,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:50,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 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-28 02:02:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 615 transitions. [2022-04-28 02:02:50,203 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 615 transitions. Word has length 23 [2022-04-28 02:02:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:50,203 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 615 transitions. [2022-04-28 02:02:50,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 615 transitions. [2022-04-28 02:02:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:50,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:50,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:50,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 02:02:50,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1782097385, now seen corresponding path program 1 times [2022-04-28 02:02:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:50,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612674607] [2022-04-28 02:02:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {10660#true} is VALID [2022-04-28 02:02:50,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-28 02:02:50,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-28 02:02:50,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:50,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {10660#true} is VALID [2022-04-28 02:02:50,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-28 02:02:50,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-28 02:02:50,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-28 02:02:50,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} [183] L58-->L58-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[] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {10660#true} [185] L58-2-->L62-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[] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#true} [187] L62-1-->L66-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[] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {10660#true} [189] L66-1-->L70-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[] {10660#true} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {10660#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#(= main_~lk5~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#(= main_~lk5~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {10665#(= main_~lk5~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {10665#(= main_~lk5~0 1)} [199] L86-1-->L92-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[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {10665#(= main_~lk5~0 1)} [203] L92-1-->L97-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[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(= main_~lk5~0 1)} [209] L97-1-->L102-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[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {10665#(= main_~lk5~0 1)} [213] L102-1-->L107-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[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#(= main_~lk5~0 1)} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-28 02:02:50,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#(= main_~lk5~0 1)} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-28 02:02:50,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-28 02:02:50,233 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-28 02:02:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:50,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612674607] [2022-04-28 02:02:50,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612674607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:50,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:50,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021919027] [2022-04-28 02:02:50,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:50,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:50,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:50,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:50,246 INFO L87 Difference]: Start difference. First operand 409 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,366 INFO L93 Difference]: Finished difference Result 717 states and 1097 transitions. [2022-04-28 02:02:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:02:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 02:02:50,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 02:02:50,423 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-28 02:02:50,439 INFO L225 Difference]: With dead ends: 717 [2022-04-28 02:02:50,439 INFO L226 Difference]: Without dead ends: 715 [2022-04-28 02:02:50,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:50,440 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:50,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-28 02:02:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-28 02:02:50,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:50,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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-28 02:02:50,449 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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-28 02:02:50,450 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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-28 02:02:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,467 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-28 02:02:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-28 02:02:50,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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 715 states. [2022-04-28 02:02:50,470 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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 715 states. [2022-04-28 02:02:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,487 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-28 02:02:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-28 02:02:50,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:50,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 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-28 02:02:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 855 transitions. [2022-04-28 02:02:50,501 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 855 transitions. Word has length 23 [2022-04-28 02:02:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:50,501 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 855 transitions. [2022-04-28 02:02:50,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 855 transitions. [2022-04-28 02:02:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:02:50,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:50,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:50,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:02:50,503 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash 715918552, now seen corresponding path program 1 times [2022-04-28 02:02:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:50,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106114586] [2022-04-28 02:02:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {13466#true} is VALID [2022-04-28 02:02:50,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-28 02:02:50,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-28 02:02:50,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {13466#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:50,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {13466#true} is VALID [2022-04-28 02:02:50,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {13466#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {13466#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {13466#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {13466#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {13466#true} [183] L58-->L58-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[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {13466#true} [185] L58-2-->L62-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[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {13466#true} [187] L62-1-->L66-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[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {13466#true} [189] L66-1-->L70-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[] {13466#true} is VALID [2022-04-28 02:02:50,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {13466#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {13471#(= main_~p5~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {13471#(= main_~p5~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {13471#(= main_~p5~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {13471#(= main_~p5~0 0)} [199] L86-1-->L92-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[] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {13471#(= main_~p5~0 0)} [203] L92-1-->L97-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[] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {13471#(= main_~p5~0 0)} [209] L97-1-->L102-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[] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {13471#(= main_~p5~0 0)} [213] L102-1-->L107-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[] {13471#(= main_~p5~0 0)} is VALID [2022-04-28 02:02:50,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {13471#(= main_~p5~0 0)} [216] L107-1-->L113: Formula: (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} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-28 02:02:50,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {13467#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-28 02:02:50,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {13467#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-28 02:02:50,539 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-28 02:02:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:50,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106114586] [2022-04-28 02:02:50,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106114586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:50,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:50,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622210195] [2022-04-28 02:02:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:50,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:50,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:50,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:50,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:50,552 INFO L87 Difference]: Start difference. First operand 585 states and 855 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,707 INFO L93 Difference]: Finished difference Result 1341 states and 1961 transitions. [2022-04-28 02:02:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-28 02:02:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 02:02:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 02:02:50,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-28 02:02:50,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:50,811 INFO L225 Difference]: With dead ends: 1341 [2022-04-28 02:02:50,811 INFO L226 Difference]: Without dead ends: 779 [2022-04-28 02:02:50,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:50,813 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:50,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-28 02:02:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-28 02:02:50,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:50,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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-28 02:02:50,828 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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-28 02:02:50,828 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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-28 02:02:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,850 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-28 02:02:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-28 02:02:50,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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 779 states. [2022-04-28 02:02:50,853 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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 779 states. [2022-04-28 02:02:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:50,876 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-28 02:02:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-28 02:02:50,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:50,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:50,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:50,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 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-28 02:02:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1111 transitions. [2022-04-28 02:02:50,900 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1111 transitions. Word has length 23 [2022-04-28 02:02:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:50,900 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1111 transitions. [2022-04-28 02:02:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-28 02:02:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1111 transitions. [2022-04-28 02:02:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:50,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:50,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 02:02:50,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 589588388, now seen corresponding path program 1 times [2022-04-28 02:02:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995096839] [2022-04-28 02:02:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:50,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {17248#true} is VALID [2022-04-28 02:02:50,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-28 02:02:50,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {17248#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {17248#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {17248#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {17248#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {17248#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {17248#true} [183] L58-->L58-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[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {17248#true} [185] L58-2-->L62-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[] {17248#true} is VALID [2022-04-28 02:02:50,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {17248#true} [187] L62-1-->L66-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[] {17248#true} is VALID [2022-04-28 02:02:50,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {17248#true} [189] L66-1-->L70-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[] {17248#true} is VALID [2022-04-28 02:02:50,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {17248#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (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, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {17253#(not (= main_~p5~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {17253#(not (= main_~p5~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {17253#(not (= main_~p5~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {17253#(not (= main_~p5~0 0))} [199] L86-1-->L92-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[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {17253#(not (= main_~p5~0 0))} [203] L92-1-->L97-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[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {17253#(not (= main_~p5~0 0))} [209] L97-1-->L102-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[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {17253#(not (= main_~p5~0 0))} [213] L102-1-->L107-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[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-28 02:02:50,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {17253#(not (= main_~p5~0 0))} [217] L107-1-->L112-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[] {17249#false} is VALID [2022-04-28 02:02:50,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {17249#false} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-28 02:02:50,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {17249#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-28 02:02:50,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {17249#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-28 02:02:50,937 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-28 02:02:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:50,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995096839] [2022-04-28 02:02:50,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995096839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:50,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:50,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068157871] [2022-04-28 02:02:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:50,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:50,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:50,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:50,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:50,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:50,951 INFO L87 Difference]: Start difference. First operand 777 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,123 INFO L93 Difference]: Finished difference Result 1165 states and 1657 transitions. [2022-04-28 02:02:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 02:02:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 02:02:51,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 02:02:51,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:51,234 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 02:02:51,235 INFO L226 Difference]: Without dead ends: 795 [2022-04-28 02:02:51,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:51,236 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:51,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-28 02:02:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-28 02:02:51,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:51,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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-28 02:02:51,249 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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-28 02:02:51,249 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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-28 02:02:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,270 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-28 02:02:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-28 02:02:51,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:51,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:51,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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 795 states. [2022-04-28 02:02:51,273 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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 795 states. [2022-04-28 02:02:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,295 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-28 02:02:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-28 02:02:51,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:51,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:51,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:51,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 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-28 02:02:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1111 transitions. [2022-04-28 02:02:51,319 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1111 transitions. Word has length 24 [2022-04-28 02:02:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:51,320 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1111 transitions. [2022-04-28 02:02:51,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1111 transitions. [2022-04-28 02:02:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:51,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:51,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:51,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 02:02:51,321 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 718671107, now seen corresponding path program 1 times [2022-04-28 02:02:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247565900] [2022-04-28 02:02:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:51,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {20902#true} is VALID [2022-04-28 02:02:51,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {20902#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {20902#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {20902#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {20902#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {20902#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {20902#true} [183] L58-->L58-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[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {20902#true} [185] L58-2-->L62-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[] {20902#true} is VALID [2022-04-28 02:02:51,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {20902#true} [187] L62-1-->L66-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[] {20902#true} is VALID [2022-04-28 02:02:51,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {20902#true} [189] L66-1-->L70-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[] {20902#true} is VALID [2022-04-28 02:02:51,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {20902#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-28 02:02:51,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {20902#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {20907#(= main_~lk6~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {20907#(= main_~lk6~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {20907#(= main_~lk6~0 1)} [199] L86-1-->L92-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[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {20907#(= main_~lk6~0 1)} [203] L92-1-->L97-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[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {20907#(= main_~lk6~0 1)} [209] L97-1-->L102-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[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {20907#(= main_~lk6~0 1)} [213] L102-1-->L107-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[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {20907#(= main_~lk6~0 1)} [217] L107-1-->L112-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[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {20907#(= main_~lk6~0 1)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-28 02:02:51,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {20907#(= main_~lk6~0 1)} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-28 02:02:51,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {20903#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-28 02:02:51,348 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-28 02:02:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247565900] [2022-04-28 02:02:51,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247565900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:51,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:51,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294651520] [2022-04-28 02:02:51,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:51,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:51,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:51,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:51,362 INFO L87 Difference]: Start difference. First operand 793 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,513 INFO L93 Difference]: Finished difference Result 1357 states and 1929 transitions. [2022-04-28 02:02:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 02:02:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 02:02:51,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 02:02:51,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:51,615 INFO L225 Difference]: With dead ends: 1357 [2022-04-28 02:02:51,615 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 02:02:51,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:51,616 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 02:02:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-28 02:02:51,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:51,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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-28 02:02:51,634 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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-28 02:02:51,635 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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-28 02:02:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,695 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-28 02:02:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-28 02:02:51,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:51,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:51,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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 1355 states. [2022-04-28 02:02:51,699 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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 1355 states. [2022-04-28 02:02:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:51,748 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-28 02:02:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-28 02:02:51,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:51,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:51,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:51,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 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-28 02:02:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1575 transitions. [2022-04-28 02:02:51,791 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1575 transitions. Word has length 24 [2022-04-28 02:02:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:51,791 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1575 transitions. [2022-04-28 02:02:51,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1575 transitions. [2022-04-28 02:02:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:02:51,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:51,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:51,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 02:02:51,793 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1078280252, now seen corresponding path program 1 times [2022-04-28 02:02:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512778243] [2022-04-28 02:02:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:51,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {26252#true} is VALID [2022-04-28 02:02:51,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {26252#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {26252#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {26252#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {26252#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {26252#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {26252#true} [183] L58-->L58-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[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {26252#true} [185] L58-2-->L62-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[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {26252#true} [187] L62-1-->L66-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[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {26252#true} [189] L66-1-->L70-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[] {26252#true} is VALID [2022-04-28 02:02:51,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {26252#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-28 02:02:51,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {26252#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {26257#(= main_~p6~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {26257#(= main_~p6~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {26257#(= main_~p6~0 0)} [199] L86-1-->L92-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[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {26257#(= main_~p6~0 0)} [203] L92-1-->L97-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[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {26257#(= main_~p6~0 0)} [209] L97-1-->L102-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[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {26257#(= main_~p6~0 0)} [213] L102-1-->L107-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[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {26257#(= main_~p6~0 0)} [217] L107-1-->L112-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[] {26257#(= main_~p6~0 0)} is VALID [2022-04-28 02:02:51,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {26257#(= main_~p6~0 0)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-28 02:02:51,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {26253#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-28 02:02:51,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {26253#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-28 02:02:51,829 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-28 02:02:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512778243] [2022-04-28 02:02:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512778243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475785926] [2022-04-28 02:02:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:51,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:51,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:51,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:51,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:51,842 INFO L87 Difference]: Start difference. First operand 1161 states and 1575 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:52,141 INFO L93 Difference]: Finished difference Result 2637 states and 3561 transitions. [2022-04-28 02:02:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:52,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-28 02:02:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 02:02:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 02:02:52,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-28 02:02:52,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:52,283 INFO L225 Difference]: With dead ends: 2637 [2022-04-28 02:02:52,283 INFO L226 Difference]: Without dead ends: 1515 [2022-04-28 02:02:52,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:52,285 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:52,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-28 02:02:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-28 02:02:52,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:52,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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-28 02:02:52,310 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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-28 02:02:52,311 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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-28 02:02:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:52,371 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-28 02:02:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-28 02:02:52,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:52,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:52,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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 1515 states. [2022-04-28 02:02:52,376 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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 1515 states. [2022-04-28 02:02:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:52,438 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-28 02:02:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-28 02:02:52,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:52,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:52,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:52,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 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-28 02:02:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1991 transitions. [2022-04-28 02:02:52,502 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1991 transitions. Word has length 24 [2022-04-28 02:02:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:52,503 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1991 transitions. [2022-04-28 02:02:52,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-28 02:02:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1991 transitions. [2022-04-28 02:02:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:02:52,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:52,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 02:02:52,504 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 804000436, now seen corresponding path program 1 times [2022-04-28 02:02:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386808475] [2022-04-28 02:02:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:52,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {33618#true} is VALID [2022-04-28 02:02:52,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {33618#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:52,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {33618#true} is VALID [2022-04-28 02:02:52,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {33618#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {33618#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {33618#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {33618#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {33618#true} is VALID [2022-04-28 02:02:52,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {33618#true} [183] L58-->L58-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[] {33618#true} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {33618#true} [185] L58-2-->L62-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[] {33618#true} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {33618#true} [187] L62-1-->L66-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[] {33618#true} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {33618#true} [189] L66-1-->L70-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[] {33618#true} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {33618#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {33618#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {33623#(not (= main_~p6~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {33623#(not (= main_~p6~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {33623#(not (= main_~p6~0 0))} [199] L86-1-->L92-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[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {33623#(not (= main_~p6~0 0))} [203] L92-1-->L97-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[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {33623#(not (= main_~p6~0 0))} [209] L97-1-->L102-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[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {33623#(not (= main_~p6~0 0))} [213] L102-1-->L107-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[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {33623#(not (= main_~p6~0 0))} [217] L107-1-->L112-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[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-28 02:02:52,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {33623#(not (= main_~p6~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-28 02:02:52,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {33619#false} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-28 02:02:52,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {33619#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-28 02:02:52,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {33619#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-28 02:02:52,539 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-28 02:02:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386808475] [2022-04-28 02:02:52,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386808475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:52,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495604792] [2022-04-28 02:02:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:52,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:52,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:52,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:52,553 INFO L87 Difference]: Start difference. First operand 1513 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:52,816 INFO L93 Difference]: Finished difference Result 2269 states and 2969 transitions. [2022-04-28 02:02:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 02:02:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 02:02:52,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 02:02:52,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:52,981 INFO L225 Difference]: With dead ends: 2269 [2022-04-28 02:02:52,982 INFO L226 Difference]: Without dead ends: 1547 [2022-04-28 02:02:52,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:52,983 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:52,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-28 02:02:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-28 02:02:53,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:53,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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-28 02:02:53,010 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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-28 02:02:53,011 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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-28 02:02:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:53,083 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-28 02:02:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-28 02:02:53,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:53,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:53,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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 1547 states. [2022-04-28 02:02:53,087 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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 1547 states. [2022-04-28 02:02:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:53,162 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-28 02:02:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-28 02:02:53,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:53,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:53,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:53,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 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-28 02:02:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1991 transitions. [2022-04-28 02:02:53,241 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1991 transitions. Word has length 25 [2022-04-28 02:02:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:53,241 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 1991 transitions. [2022-04-28 02:02:53,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1991 transitions. [2022-04-28 02:02:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:02:53,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:53,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:53,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 02:02:53,243 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 933083155, now seen corresponding path program 1 times [2022-04-28 02:02:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:53,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089094615] [2022-04-28 02:02:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:53,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {40712#true} is VALID [2022-04-28 02:02:53,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {40712#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:53,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {40712#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {40712#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {40712#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {40712#true} is VALID [2022-04-28 02:02:53,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {40712#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {40712#true} [183] L58-->L58-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[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {40712#true} [185] L58-2-->L62-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[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {40712#true} [187] L62-1-->L66-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[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {40712#true} [189] L66-1-->L70-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[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {40712#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {40712#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {40712#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {40717#(= main_~lk7~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {40717#(= main_~lk7~0 1)} [199] L86-1-->L92-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[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {40717#(= main_~lk7~0 1)} [203] L92-1-->L97-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[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {40717#(= main_~lk7~0 1)} [209] L97-1-->L102-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[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {40717#(= main_~lk7~0 1)} [213] L102-1-->L107-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[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {40717#(= main_~lk7~0 1)} [217] L107-1-->L112-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[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {40717#(= main_~lk7~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {40717#(= main_~lk7~0 1)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-28 02:02:53,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {40717#(= main_~lk7~0 1)} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-28 02:02:53,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {40713#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-28 02:02:53,271 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-28 02:02:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:53,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089094615] [2022-04-28 02:02:53,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089094615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:53,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:53,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647880708] [2022-04-28 02:02:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:53,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:53,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:53,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:53,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:53,284 INFO L87 Difference]: Start difference. First operand 1545 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:53,567 INFO L93 Difference]: Finished difference Result 2573 states and 3337 transitions. [2022-04-28 02:02:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:53,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 02:02:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 02:02:53,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-28 02:02:53,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:53,796 INFO L225 Difference]: With dead ends: 2573 [2022-04-28 02:02:53,796 INFO L226 Difference]: Without dead ends: 2571 [2022-04-28 02:02:53,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:53,797 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:53,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-28 02:02:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-28 02:02:53,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:53,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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-28 02:02:53,844 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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-28 02:02:53,846 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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-28 02:02:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:54,024 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-28 02:02:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-28 02:02:54,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:54,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:54,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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 2571 states. [2022-04-28 02:02:54,030 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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 2571 states. [2022-04-28 02:02:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:54,200 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-28 02:02:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-28 02:02:54,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:54,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:54,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:54,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 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-28 02:02:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2887 transitions. [2022-04-28 02:02:54,366 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2887 transitions. Word has length 25 [2022-04-28 02:02:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:54,367 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2887 transitions. [2022-04-28 02:02:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2887 transitions. [2022-04-28 02:02:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:02:54,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:54,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:54,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 02:02:54,378 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -863868204, now seen corresponding path program 1 times [2022-04-28 02:02:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:54,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546279835] [2022-04-28 02:02:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:54,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {50958#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:54,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {50958#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {50958#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {50958#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {50958#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {50958#true} [183] L58-->L58-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[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {50958#true} [185] L58-2-->L62-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[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {50958#true} [187] L62-1-->L66-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[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {50958#true} [189] L66-1-->L70-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[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {50958#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {50958#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-28 02:02:54,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {50958#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {50963#(= main_~p7~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {50963#(= main_~p7~0 0)} [199] L86-1-->L92-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[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {50963#(= main_~p7~0 0)} [203] L92-1-->L97-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[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {50963#(= main_~p7~0 0)} [209] L97-1-->L102-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[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {50963#(= main_~p7~0 0)} [213] L102-1-->L107-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[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {50963#(= main_~p7~0 0)} [217] L107-1-->L112-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[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {50963#(= main_~p7~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-28 02:02:54,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {50963#(= main_~p7~0 0)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-28 02:02:54,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {50959#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-28 02:02:54,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {50959#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-28 02:02:54,417 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-28 02:02:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:54,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546279835] [2022-04-28 02:02:54,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546279835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:54,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:54,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122179029] [2022-04-28 02:02:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:54,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:54,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:54,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:54,431 INFO L87 Difference]: Start difference. First operand 2313 states and 2887 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:55,298 INFO L93 Difference]: Finished difference Result 5197 states and 6409 transitions. [2022-04-28 02:02:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-28 02:02:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 02:02:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 02:02:55,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-28 02:02:55,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:55,617 INFO L225 Difference]: With dead ends: 5197 [2022-04-28 02:02:55,618 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 02:02:55,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:55,621 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:55,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 02:02:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-28 02:02:55,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:55,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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-28 02:02:55,696 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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-28 02:02:55,699 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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-28 02:02:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:55,920 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-28 02:02:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-28 02:02:55,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:55,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:55,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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 2955 states. [2022-04-28 02:02:55,930 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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 2955 states. [2022-04-28 02:02:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:56,156 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-28 02:02:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-28 02:02:56,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:56,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:56,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:56,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 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-28 02:02:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3527 transitions. [2022-04-28 02:02:56,396 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3527 transitions. Word has length 25 [2022-04-28 02:02:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:56,397 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3527 transitions. [2022-04-28 02:02:56,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-28 02:02:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3527 transitions. [2022-04-28 02:02:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:02:56,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:56,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 02:02:56,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1139160544, now seen corresponding path program 1 times [2022-04-28 02:02:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599674518] [2022-04-28 02:02:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:56,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {65364#true} is VALID [2022-04-28 02:02:56,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {65364#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {65364#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {65364#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {65364#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {65364#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {65364#true} [183] L58-->L58-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[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {65364#true} [185] L58-2-->L62-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[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {65364#true} [187] L62-1-->L66-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[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {65364#true} [189] L66-1-->L70-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[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {65364#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {65364#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-28 02:02:56,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {65364#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {65369#(not (= main_~p7~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {65369#(not (= main_~p7~0 0))} [199] L86-1-->L92-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[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {65369#(not (= main_~p7~0 0))} [203] L92-1-->L97-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[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {65369#(not (= main_~p7~0 0))} [209] L97-1-->L102-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[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {65369#(not (= main_~p7~0 0))} [213] L102-1-->L107-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[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {65369#(not (= main_~p7~0 0))} [217] L107-1-->L112-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[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {65369#(not (= main_~p7~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-28 02:02:56,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {65369#(not (= main_~p7~0 0))} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-28 02:02:56,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {65365#false} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-28 02:02:56,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {65365#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-28 02:02:56,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {65365#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-28 02:02:56,428 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-28 02:02:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:56,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599674518] [2022-04-28 02:02:56,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599674518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:56,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:56,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087174772] [2022-04-28 02:02:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:02:56,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:56,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:56,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:56,443 INFO L87 Difference]: Start difference. First operand 2953 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,113 INFO L93 Difference]: Finished difference Result 4429 states and 5257 transitions. [2022-04-28 02:02:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:02:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:02:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:02:57,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 02:02:57,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:57,443 INFO L225 Difference]: With dead ends: 4429 [2022-04-28 02:02:57,443 INFO L226 Difference]: Without dead ends: 3019 [2022-04-28 02:02:57,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:57,445 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:57,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-28 02:02:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-28 02:02:57,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:57,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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-28 02:02:57,494 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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-28 02:02:57,495 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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-28 02:02:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,721 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-28 02:02:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-28 02:02:57,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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 3019 states. [2022-04-28 02:02:57,728 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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 3019 states. [2022-04-28 02:02:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:57,953 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-28 02:02:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-28 02:02:57,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:02:57,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:02:57,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:02:57,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:02:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 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-28 02:02:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3527 transitions. [2022-04-28 02:02:58,230 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3527 transitions. Word has length 26 [2022-04-28 02:02:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:02:58,231 INFO L495 AbstractCegarLoop]: Abstraction has 3017 states and 3527 transitions. [2022-04-28 02:02:58,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3527 transitions. [2022-04-28 02:02:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:02:58,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:02:58,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:02:58,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 02:02:58,233 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:02:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:02:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1010077825, now seen corresponding path program 1 times [2022-04-28 02:02:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:02:58,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849222320] [2022-04-28 02:02:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:02:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:02:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:02:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:02:58,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {79194#true} is VALID [2022-04-28 02:02:58,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {79194#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:02:58,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {79194#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {79194#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {79194#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {79194#true} is VALID [2022-04-28 02:02:58,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {79194#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {79194#true} [183] L58-->L58-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[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {79194#true} [185] L58-2-->L62-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[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {79194#true} [187] L62-1-->L66-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[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {79194#true} [189] L66-1-->L70-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[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {79194#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {79194#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {79194#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {79194#true} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {79199#(= main_~lk8~0 1)} [199] L86-1-->L92-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[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {79199#(= main_~lk8~0 1)} [203] L92-1-->L97-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[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {79199#(= main_~lk8~0 1)} [209] L97-1-->L102-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[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {79199#(= main_~lk8~0 1)} [213] L102-1-->L107-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[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {79199#(= main_~lk8~0 1)} [217] L107-1-->L112-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[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {79199#(= main_~lk8~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {79199#(= main_~lk8~0 1)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {79199#(= main_~lk8~0 1)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-28 02:02:58,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {79199#(= main_~lk8~0 1)} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-28 02:02:58,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {79195#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-28 02:02:58,260 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-28 02:02:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:02:58,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849222320] [2022-04-28 02:02:58,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849222320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:02:58,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:02:58,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:02:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279333573] [2022-04-28 02:02:58,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:02:58,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:02:58,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:02:58,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:58,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:02:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:02:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:02:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:02:58,273 INFO L87 Difference]: Start difference. First operand 3017 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:02:59,055 INFO L93 Difference]: Finished difference Result 4875 states and 5640 transitions. [2022-04-28 02:02:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:02:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:02:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:02:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 02:02:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:02:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 02:02:59,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-28 02:02:59,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:02:59,745 INFO L225 Difference]: With dead ends: 4875 [2022-04-28 02:02:59,746 INFO L226 Difference]: Without dead ends: 4873 [2022-04-28 02:02:59,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:02:59,748 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:02:59,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:02:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-28 02:02:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-28 02:02:59,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:02:59,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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-28 02:02:59,832 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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-28 02:02:59,834 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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-28 02:03:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:00,483 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-28 02:03:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-28 02:03:00,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:00,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:00,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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 4873 states. [2022-04-28 02:03:00,493 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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 4873 states. [2022-04-28 02:03:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:01,130 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-28 02:03:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-28 02:03:01,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:01,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:01,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:01,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 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-28 02:03:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5255 transitions. [2022-04-28 02:03:01,776 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5255 transitions. Word has length 26 [2022-04-28 02:03:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:01,777 INFO L495 AbstractCegarLoop]: Abstraction has 4617 states and 5255 transitions. [2022-04-28 02:03:01,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5255 transitions. [2022-04-28 02:03:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:03:01,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:03:01,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 02:03:01,780 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:03:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:03:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1487938112, now seen corresponding path program 1 times [2022-04-28 02:03:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:03:01,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051959629] [2022-04-28 02:03:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:03:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:03:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:03:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:03:01,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {98841#true} is VALID [2022-04-28 02:03:01,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {98841#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:03:01,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] 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] {98841#true} is VALID [2022-04-28 02:03:01,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {98841#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {98841#true} [173] mainENTRY-->L127-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_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_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~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{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_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {98841#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {98841#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 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_2, main_~lk3~0=v_main_~lk3~0_2, 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_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, 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, main_~lk6~0, main_~lk8~0, main_~lk7~0] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {98841#true} [183] L58-->L58-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[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {98841#true} [185] L58-2-->L62-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[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {98841#true} [187] L62-1-->L66-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[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {98841#true} [189] L66-1-->L70-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[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {98841#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {98841#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {98841#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-28 02:03:01,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {98841#true} [197] L82-1-->L86-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {98846#(= main_~p8~0 0)} [199] L86-1-->L92-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[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {98846#(= main_~p8~0 0)} [203] L92-1-->L97-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[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {98846#(= main_~p8~0 0)} [209] L97-1-->L102-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[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {98846#(= main_~p8~0 0)} [213] L102-1-->L107-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[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {98846#(= main_~p8~0 0)} [217] L107-1-->L112-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[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {98846#(= main_~p8~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {98846#(= main_~p8~0 0)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-28 02:03:01,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {98846#(= main_~p8~0 0)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-28 02:03:01,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {98842#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-28 02:03:01,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {98842#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-28 02:03:01,815 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-28 02:03:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:03:01,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051959629] [2022-04-28 02:03:01,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051959629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:03:01,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:03:01,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:03:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997952335] [2022-04-28 02:03:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:03:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:03:01,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:03:01,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:01,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:01,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:03:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:03:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:03:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:03:01,830 INFO L87 Difference]: Start difference. First operand 4617 states and 5255 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,804 INFO L93 Difference]: Finished difference Result 10249 states and 11399 transitions. [2022-04-28 02:03:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:03:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-28 02:03:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:03:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:03:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 02:03:04,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 02:03:04,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:03:04,883 INFO L225 Difference]: With dead ends: 10249 [2022-04-28 02:03:04,883 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:03:04,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:03:04,891 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:03:04,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:03:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:03:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:03:04,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:03:04,892 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-28 02:03:04,892 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-28 02:03:04,892 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-28 02:03:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:03:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:03:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:04,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:04,892 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-28 02:03:04,892 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-28 02:03:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:03:04,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:03:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:03:04,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:04,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:03:04,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:03:04,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:03:04,893 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-28 02:03:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:03:04,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 02:03:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:03:04,893 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:03:04,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-28 02:03:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:03:04,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:03:04,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:03:04,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 02:03:04,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:03:15,051 WARN L232 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 1070 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 02:03:15,083 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 02:03:15,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:03:15,084 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-28 02:03:15,084 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-28 02:03:15,084 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 137) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 137) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,084 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-04-28 02:03:15,085 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,086 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-04-28 02:03:15,086 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-04-28 02:03:15,086 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-04-28 02:03:15,088 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:03:15,089 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-28 02:03:15,093 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-28 02:03:15,094 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-28 02:03:15,095 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-28 02:03:15,096 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-28 02:03:15,096 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-28 02:03:15,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:03:15 BasicIcfg [2022-04-28 02:03:15,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:03:15,101 INFO L158 Benchmark]: Toolchain (without parser) took 29736.73ms. Allocated memory was 161.5MB in the beginning and 402.7MB in the end (delta: 241.2MB). Free memory was 103.8MB in the beginning and 235.1MB in the end (delta: -131.3MB). Peak memory consumption was 225.4MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,101 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:03:15,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.62ms. Allocated memory was 161.5MB in the beginning and 231.7MB in the end (delta: 70.3MB). Free memory was 103.5MB in the beginning and 203.1MB in the end (delta: -99.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,102 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 231.7MB. Free memory was 203.1MB in the beginning and 201.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,102 INFO L158 Benchmark]: RCFGBuilder took 330.50ms. Allocated memory is still 231.7MB. Free memory was 201.1MB in the beginning and 186.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,102 INFO L158 Benchmark]: IcfgTransformer took 47.33ms. Allocated memory is still 231.7MB. Free memory was 186.4MB in the beginning and 184.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,103 INFO L158 Benchmark]: TraceAbstraction took 29110.76ms. Allocated memory was 231.7MB in the beginning and 402.7MB in the end (delta: 170.9MB). Free memory was 183.8MB in the beginning and 235.1MB in the end (delta: -51.3MB). Peak memory consumption was 235.8MB. Max. memory is 8.0GB. [2022-04-28 02:03:15,107 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.09ms. Allocated memory is still 161.5MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.62ms. Allocated memory was 161.5MB in the beginning and 231.7MB in the end (delta: 70.3MB). Free memory was 103.5MB in the beginning and 203.1MB in the end (delta: -99.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 231.7MB. Free memory was 203.1MB in the beginning and 201.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.50ms. Allocated memory is still 231.7MB. Free memory was 201.1MB in the beginning and 186.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 47.33ms. Allocated memory is still 231.7MB. Free memory was 186.4MB in the beginning and 184.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 29110.76ms. Allocated memory was 231.7MB in the beginning and 402.7MB in the end (delta: 170.9MB). Free memory was 183.8MB in the beginning and 235.1MB in the end (delta: -51.3MB). Peak memory consumption was 235.8MB. 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: 135]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1622 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=22, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 10.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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: 35]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:03:15,135 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...