/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:00:28,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:00:28,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:00:28,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:00:28,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:00:28,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:00:28,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:00:28,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:00:28,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:00:28,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:00:28,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:00:28,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:00:28,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:00:28,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:00:28,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:00:28,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:00:28,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:00:28,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:00:28,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:00:28,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:00:28,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:00:28,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:00:28,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:00:28,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:00:28,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:00:28,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:00:28,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:00:28,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:00:28,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:00:28,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:00:28,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:00:28,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:00:28,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:00:28,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:00:28,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:00:28,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:00:28,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:00:28,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:00:28,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:00:28,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:00:28,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:00:28,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:00:28,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 05:00:28,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:00:28,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:00:28,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 05:00:28,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 05:00:28,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 05:00:28,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 05:00:28,652 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 05:00:28,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:00:28,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:00:28,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:00:28,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:00:28,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:00:28,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:00:28,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:00:28,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:00:28,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:00:28,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:00:28,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:00:28,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:00:28,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:00:28,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:00:28,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 05:00:28,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 05:00:28,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 05:00:28,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 05:00:28,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:00:28,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 05:00:28,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 05:00:28,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 05:00:28,658 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:00:28,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:00:28,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:00:28,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:00:28,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:00:28,938 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:00:28,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 05:00:29,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d186a0f74/ad0970ee6f044dbe95271100e7e3fc73/FLAGa17144ee4 [2022-04-15 05:00:29,434 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:00:29,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-15 05:00:29,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d186a0f74/ad0970ee6f044dbe95271100e7e3fc73/FLAGa17144ee4 [2022-04-15 05:00:29,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d186a0f74/ad0970ee6f044dbe95271100e7e3fc73 [2022-04-15 05:00:29,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:00:29,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 05:00:29,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:00:29,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:00:29,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:00:29,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180f5c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29, skipping insertion in model container [2022-04-15 05:00:29,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:00:29,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:00:29,649 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_10.c[3901,3914] [2022-04-15 05:00:29,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:00:29,665 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:00:29,687 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_10.c[3901,3914] [2022-04-15 05:00:29,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:00:29,698 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:00:29,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29 WrapperNode [2022-04-15 05:00:29,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:00:29,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:00:29,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:00:29,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:00:29,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:00:29,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:00:29,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:00:29,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:00:29,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (1/1) ... [2022-04-15 05:00:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:00:29,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:00:29,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:00:29,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:00:29,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:00:29,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:00:29,820 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:00:29,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:00:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:00:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:00:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:00:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:00:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:00:29,877 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:00:29,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:00:30,079 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:00:30,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:00:30,086 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:00:30,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:30 BoogieIcfgContainer [2022-04-15 05:00:30,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:00:30,088 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 05:00:30,088 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 05:00:30,089 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 05:00:30,092 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:30" (1/1) ... [2022-04-15 05:00:30,097 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 05:00:30,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:00:30 BasicIcfg [2022-04-15 05:00:30,177 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 05:00:30,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:00:30,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:00:30,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:00:30,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:00:29" (1/4) ... [2022-04-15 05:00:30,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4079f1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:00:30, skipping insertion in model container [2022-04-15 05:00:30,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:00:29" (2/4) ... [2022-04-15 05:00:30,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4079f1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:00:30, skipping insertion in model container [2022-04-15 05:00:30,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:00:30" (3/4) ... [2022-04-15 05:00:30,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4079f1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:00:30, skipping insertion in model container [2022-04-15 05:00:30,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:00:30" (4/4) ... [2022-04-15 05:00:30,187 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.cqvasr [2022-04-15 05:00:30,192 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:00:30,193 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:00:30,228 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:00:30,233 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:00:30,234 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:00:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:00:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:00:30,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:30,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:30,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash -666508425, now seen corresponding path program 1 times [2022-04-15 05:00:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:30,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142711802] [2022-04-15 05:00:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:30,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {48#true} is VALID [2022-04-15 05:00:30,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-15 05:00:30,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-15 05:00:30,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:30,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {48#true} is VALID [2022-04-15 05:00:30,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-15 05:00:30,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-15 05:00:30,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-15 05:00:30,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {48#true} is VALID [2022-04-15 05:00:30,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {48#true} is VALID [2022-04-15 05:00:30,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {48#true} is VALID [2022-04-15 05:00:30,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} [216] L68-->L68-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} [218] L68-2-->L72-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} [220] L72-1-->L76-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} [222] L76-1-->L80-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} [228] L88-1-->L92-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} [230] L92-1-->L96-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} [236] L104-1-->L111: 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[] {53#(= main_~lk1~0 1)} is VALID [2022-04-15 05:00:30,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} [238] L111-->L156-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[] {49#false} is VALID [2022-04-15 05:00:30,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#false} is VALID [2022-04-15 05:00:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:30,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:30,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142711802] [2022-04-15 05:00:30,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142711802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:30,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:30,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959039974] [2022-04-15 05:00:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:30,533 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-15 05:00:30,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:30,538 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-15 05:00:30,578 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-15 05:00:30,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:30,610 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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.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-15 05:00:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,107 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-15 05:00:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:31,107 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-15 05:00:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:31,109 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-15 05:00:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:00:31,126 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-15 05:00:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:00:31,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 05:00:31,275 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-15 05:00:31,288 INFO L225 Difference]: With dead ends: 88 [2022-04-15 05:00:31,289 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 05:00:31,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:31,298 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:31,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 05:00:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-15 05:00:31,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:31,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,339 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,341 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,354 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 05:00:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 05:00:31,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:31,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:31,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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 73 states. [2022-04-15 05:00:31,359 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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 73 states. [2022-04-15 05:00:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,366 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-15 05:00:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-15 05:00:31,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:31,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:31,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:31,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-15 05:00:31,381 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-15 05:00:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:31,382 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-15 05:00:31,382 INFO L479 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-15 05:00:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-15 05:00:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:00:31,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:31,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:31,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:00:31,384 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -959911432, now seen corresponding path program 1 times [2022-04-15 05:00:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:31,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716998941] [2022-04-15 05:00:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:31,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {363#true} is VALID [2022-04-15 05:00:31,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-15 05:00:31,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-15 05:00:31,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:31,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {363#true} is VALID [2022-04-15 05:00:31,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-15 05:00:31,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-15 05:00:31,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-15 05:00:31,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {363#true} is VALID [2022-04-15 05:00:31,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {363#true} is VALID [2022-04-15 05:00:31,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {363#true} is VALID [2022-04-15 05:00:31,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} [217] L68-->L68-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[] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= main_~p1~0 0)} [218] L68-2-->L72-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] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(= main_~p1~0 0)} [220] L72-1-->L76-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] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(= main_~p1~0 0)} [222] L76-1-->L80-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] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(= main_~p1~0 0)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#(= main_~p1~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#(= main_~p1~0 0)} [228] L88-1-->L92-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] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#(= main_~p1~0 0)} [230] L92-1-->L96-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] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#(= main_~p1~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#(= main_~p1~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {368#(= main_~p1~0 0)} is VALID [2022-04-15 05:00:31,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#(= main_~p1~0 0)} [236] L104-1-->L111: 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[] {364#false} is VALID [2022-04-15 05:00:31,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} [238] L111-->L156-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[] {364#false} is VALID [2022-04-15 05:00:31,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-15 05:00:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:31,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716998941] [2022-04-15 05:00:31,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716998941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:31,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:31,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429513621] [2022-04-15 05:00:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:31,515 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-15 05:00:31,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:31,516 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-15 05:00:31,536 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-15 05:00:31,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:31,537 INFO L87 Difference]: Start difference. First operand 51 states and 90 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-15 05:00:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,761 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-15 05:00:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:31,762 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-15 05:00:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:31,763 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-15 05:00:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 05:00:31,767 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-15 05:00:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-15 05:00:31,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-15 05:00:31,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:31,939 INFO L225 Difference]: With dead ends: 118 [2022-04-15 05:00:31,939 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 05:00:31,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:31,941 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:31,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 05:00:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 05:00:31,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:31,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,958 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,958 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,964 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 05:00:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 05:00:31,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:31,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:31,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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 73 states. [2022-04-15 05:00:31,971 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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 73 states. [2022-04-15 05:00:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:31,976 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-15 05:00:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-15 05:00:31,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:31,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:31,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:31,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-15 05:00:31,984 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-15 05:00:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:31,984 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-15 05:00:31,985 INFO L479 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-15 05:00:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-15 05:00:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:00:31,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:31,987 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:31,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:00:31,987 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 813107322, now seen corresponding path program 1 times [2022-04-15 05:00:31,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:31,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849079639] [2022-04-15 05:00:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {727#true} is VALID [2022-04-15 05:00:32,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-15 05:00:32,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {727#true} {727#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-15 05:00:32,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {727#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:32,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {727#true} is VALID [2022-04-15 05:00:32,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-15 05:00:32,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-15 05:00:32,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {727#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-15 05:00:32,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {727#true} is VALID [2022-04-15 05:00:32,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {727#true} is VALID [2022-04-15 05:00:32,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {727#true} is VALID [2022-04-15 05:00:32,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#true} [216] L68-->L68-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {732#(not (= main_~p1~0 0))} [218] L68-2-->L72-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {732#(not (= main_~p1~0 0))} [220] L72-1-->L76-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {732#(not (= main_~p1~0 0))} [222] L76-1-->L80-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {732#(not (= main_~p1~0 0))} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(not (= main_~p1~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(not (= main_~p1~0 0))} [228] L88-1-->L92-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {732#(not (= main_~p1~0 0))} [230] L92-1-->L96-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] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {732#(not (= main_~p1~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#(not (= main_~p1~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {732#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:00:32,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#(not (= main_~p1~0 0))} [237] L104-1-->L110-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[] {728#false} is VALID [2022-04-15 05:00:32,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#false} [240] L110-1-->L116: 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[] {728#false} is VALID [2022-04-15 05:00:32,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#false} [244] L116-->L156-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[] {728#false} is VALID [2022-04-15 05:00:32,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {728#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-15 05:00:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:32,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849079639] [2022-04-15 05:00:32,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849079639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:32,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:32,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686904440] [2022-04-15 05:00:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:32,064 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-15 05:00:32,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:32,065 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-15 05:00:32,083 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-15 05:00:32,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:32,085 INFO L87 Difference]: Start difference. First operand 71 states and 126 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-15 05:00:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,274 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-15 05:00:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:32,275 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-15 05:00:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:32,275 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-15 05:00:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 05:00:32,279 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-15 05:00:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-15 05:00:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-15 05:00:32,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:32,428 INFO L225 Difference]: With dead ends: 109 [2022-04-15 05:00:32,428 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 05:00:32,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:32,430 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:32,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 05:00:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-15 05:00:32,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:32,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,437 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,437 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,440 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 05:00:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 05:00:32,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:32,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:32,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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 76 states. [2022-04-15 05:00:32,442 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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 76 states. [2022-04-15 05:00:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,445 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-15 05:00:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-15 05:00:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:32,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:32,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:32,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-15 05:00:32,449 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-15 05:00:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:32,449 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-15 05:00:32,449 INFO L479 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-15 05:00:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-15 05:00:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:00:32,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:32,450 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:32,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:00:32,450 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 307548697, now seen corresponding path program 1 times [2022-04-15 05:00:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:32,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295213073] [2022-04-15 05:00:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-15 05:00:32,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-15 05:00:32,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1093#true} {1093#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-15 05:00:32,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:32,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1093#true} is VALID [2022-04-15 05:00:32,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-15 05:00:32,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-15 05:00:32,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1093#true} is VALID [2022-04-15 05:00:32,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1093#true} is VALID [2022-04-15 05:00:32,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {1093#true} is VALID [2022-04-15 05:00:32,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1093#true} is VALID [2022-04-15 05:00:32,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1093#true} [217] L68-->L68-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[] {1093#true} is VALID [2022-04-15 05:00:32,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {1093#true} [218] L68-2-->L72-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(= main_~lk2~0 1)} [220] L72-1-->L76-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(= main_~lk2~0 1)} [222] L76-1-->L80-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#(= main_~lk2~0 1)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#(= main_~lk2~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(= main_~lk2~0 1)} [228] L88-1-->L92-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(= main_~lk2~0 1)} [230] L92-1-->L96-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] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {1098#(= main_~lk2~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {1098#(= main_~lk2~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {1098#(= main_~lk2~0 1)} [237] L104-1-->L110-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[] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1098#(= main_~lk2~0 1)} [240] L110-1-->L116: 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[] {1098#(= main_~lk2~0 1)} is VALID [2022-04-15 05:00:32,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1098#(= main_~lk2~0 1)} [244] L116-->L156-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[] {1094#false} is VALID [2022-04-15 05:00:32,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1094#false} is VALID [2022-04-15 05:00:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295213073] [2022-04-15 05:00:32,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295213073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:32,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:32,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768059000] [2022-04-15 05:00:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:32,520 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-15 05:00:32,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:32,520 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-15 05:00:32,537 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-15 05:00:32,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:32,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:32,539 INFO L87 Difference]: Start difference. First operand 74 states and 128 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-15 05:00:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,721 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2022-04-15 05:00:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:32,722 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-15 05:00:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:32,722 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-15 05:00:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:00:32,724 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-15 05:00:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:00:32,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 05:00:32,838 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-15 05:00:32,841 INFO L225 Difference]: With dead ends: 137 [2022-04-15 05:00:32,841 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 05:00:32,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:32,842 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:32,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 05:00:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-04-15 05:00:32,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:32,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,850 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,851 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,856 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-15 05:00:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-15 05:00:32,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:32,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:32,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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 135 states. [2022-04-15 05:00:32,857 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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 135 states. [2022-04-15 05:00:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:32,862 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-15 05:00:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-15 05:00:32,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:32,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:32,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:32,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 169 transitions. [2022-04-15 05:00:32,867 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 169 transitions. Word has length 22 [2022-04-15 05:00:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:32,867 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 169 transitions. [2022-04-15 05:00:32,867 INFO L479 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-15 05:00:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 169 transitions. [2022-04-15 05:00:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:00:32,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:32,868 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:32,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:00:32,869 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash 14145690, now seen corresponding path program 1 times [2022-04-15 05:00:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:32,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245504265] [2022-04-15 05:00:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:32,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1629#true} is VALID [2022-04-15 05:00:32,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-15 05:00:32,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1629#true} {1629#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-15 05:00:32,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {1629#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:32,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1629#true} is VALID [2022-04-15 05:00:32,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1629#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-15 05:00:32,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1629#true} {1629#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-15 05:00:32,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {1629#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1629#true} is VALID [2022-04-15 05:00:32,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {1629#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1629#true} is VALID [2022-04-15 05:00:32,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {1629#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {1629#true} is VALID [2022-04-15 05:00:32,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1629#true} is VALID [2022-04-15 05:00:32,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} [217] L68-->L68-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[] {1629#true} is VALID [2022-04-15 05:00:32,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {1629#true} [219] L68-2-->L72-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[] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {1634#(= main_~p2~0 0)} [220] L72-1-->L76-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] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {1634#(= main_~p2~0 0)} [222] L76-1-->L80-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] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(= main_~p2~0 0)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1634#(= main_~p2~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {1634#(= main_~p2~0 0)} [228] L88-1-->L92-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] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(= main_~p2~0 0)} [230] L92-1-->L96-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] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(= main_~p2~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {1634#(= main_~p2~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {1634#(= main_~p2~0 0)} [237] L104-1-->L110-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[] {1634#(= main_~p2~0 0)} is VALID [2022-04-15 05:00:32,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(= main_~p2~0 0)} [240] L110-1-->L116: 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[] {1630#false} is VALID [2022-04-15 05:00:32,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#false} [244] L116-->L156-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[] {1630#false} is VALID [2022-04-15 05:00:32,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1630#false} is VALID [2022-04-15 05:00:32,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-15 05:00:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245504265] [2022-04-15 05:00:32,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245504265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:32,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:32,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769564498] [2022-04-15 05:00:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:32,945 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-15 05:00:32,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:32,945 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-15 05:00:32,963 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-15 05:00:32,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:32,964 INFO L87 Difference]: Start difference. First operand 97 states and 169 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-15 05:00:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,142 INFO L93 Difference]: Finished difference Result 225 states and 399 transitions. [2022-04-15 05:00:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:33,143 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-15 05:00:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:33,143 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-15 05:00:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-15 05:00:33,146 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-15 05:00:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-15 05:00:33,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-15 05:00:33,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:33,385 INFO L225 Difference]: With dead ends: 225 [2022-04-15 05:00:33,386 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 05:00:33,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:33,387 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:33,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 05:00:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 05:00:33,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:33,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,404 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,404 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,413 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-15 05:00:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-15 05:00:33,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:33,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:33,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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 137 states. [2022-04-15 05:00:33,416 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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 137 states. [2022-04-15 05:00:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,420 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-15 05:00:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-15 05:00:33,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:33,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:33,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:33,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-15 05:00:33,426 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-15 05:00:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:33,428 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-15 05:00:33,428 INFO L479 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-15 05:00:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-15 05:00:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:00:33,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:33,429 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:33,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 05:00:33,429 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 944107156, now seen corresponding path program 1 times [2022-04-15 05:00:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:33,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477625093] [2022-04-15 05:00:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:33,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2299#true} is VALID [2022-04-15 05:00:33,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-15 05:00:33,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2299#true} {2299#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-15 05:00:33,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {2299#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:33,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2299#true} is VALID [2022-04-15 05:00:33,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {2299#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-15 05:00:33,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-15 05:00:33,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {2299#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2299#true} is VALID [2022-04-15 05:00:33,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {2299#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2299#true} is VALID [2022-04-15 05:00:33,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {2299#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2299#true} is VALID [2022-04-15 05:00:33,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2299#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2299#true} is VALID [2022-04-15 05:00:33,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2299#true} [217] L68-->L68-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[] {2299#true} is VALID [2022-04-15 05:00:33,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {2299#true} [218] L68-2-->L72-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {2304#(not (= main_~p2~0 0))} [220] L72-1-->L76-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2304#(not (= main_~p2~0 0))} [222] L76-1-->L80-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2304#(not (= main_~p2~0 0))} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2304#(not (= main_~p2~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {2304#(not (= main_~p2~0 0))} [228] L88-1-->L92-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2304#(not (= main_~p2~0 0))} [230] L92-1-->L96-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] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {2304#(not (= main_~p2~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2304#(not (= main_~p2~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {2304#(not (= main_~p2~0 0))} [237] L104-1-->L110-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[] {2304#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:00:33,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {2304#(not (= main_~p2~0 0))} [241] L110-1-->L115-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[] {2300#false} is VALID [2022-04-15 05:00:33,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {2300#false} [246] L115-1-->L121: 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[] {2300#false} is VALID [2022-04-15 05:00:33,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {2300#false} [248] L121-->L156-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[] {2300#false} is VALID [2022-04-15 05:00:33,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {2300#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#false} is VALID [2022-04-15 05:00:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:33,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477625093] [2022-04-15 05:00:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477625093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693770926] [2022-04-15 05:00:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:33,578 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-15 05:00:33,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:33,578 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-15 05:00:33,594 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-15 05:00:33,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:33,595 INFO L87 Difference]: Start difference. First operand 135 states and 235 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-15 05:00:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,806 INFO L93 Difference]: Finished difference Result 202 states and 350 transitions. [2022-04-15 05:00:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:33,806 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-15 05:00:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:33,807 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-15 05:00:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 05:00:33,810 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-15 05:00:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-15 05:00:33,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-15 05:00:33,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:33,966 INFO L225 Difference]: With dead ends: 202 [2022-04-15 05:00:33,967 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 05:00:33,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:33,970 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:33,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 110 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 05:00:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-04-15 05:00:33,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:33,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,986 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,987 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,990 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-15 05:00:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-15 05:00:33,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:33,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:33,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 05:00:33,992 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-15 05:00:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:33,996 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-15 05:00:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-15 05:00:33,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:33,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:33,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:33,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 235 transitions. [2022-04-15 05:00:34,001 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 235 transitions. Word has length 23 [2022-04-15 05:00:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:34,001 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 235 transitions. [2022-04-15 05:00:34,002 INFO L479 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-15 05:00:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 235 transitions. [2022-04-15 05:00:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:00:34,002 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:34,002 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:34,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:00:34,003 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash 438548531, now seen corresponding path program 1 times [2022-04-15 05:00:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:34,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308828287] [2022-04-15 05:00:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2952#true} is VALID [2022-04-15 05:00:34,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-15 05:00:34,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2952#true} {2952#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-15 05:00:34,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {2952#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:34,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2952#true} is VALID [2022-04-15 05:00:34,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {2952#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2952#true} {2952#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {2952#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {2952#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2952#true} is VALID [2022-04-15 05:00:34,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2952#true} [217] L68-->L68-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[] {2952#true} is VALID [2022-04-15 05:00:34,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {2952#true} [219] L68-2-->L72-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[] {2952#true} is VALID [2022-04-15 05:00:34,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {2952#true} [220] L72-1-->L76-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] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {2957#(= main_~lk3~0 1)} [222] L76-1-->L80-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] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {2957#(= main_~lk3~0 1)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {2957#(= main_~lk3~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {2957#(= main_~lk3~0 1)} [228] L88-1-->L92-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] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {2957#(= main_~lk3~0 1)} [230] L92-1-->L96-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] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {2957#(= main_~lk3~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {2957#(= main_~lk3~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {2957#(= main_~lk3~0 1)} [237] L104-1-->L110-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[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {2957#(= main_~lk3~0 1)} [241] L110-1-->L115-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[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {2957#(= main_~lk3~0 1)} [246] L115-1-->L121: 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[] {2957#(= main_~lk3~0 1)} is VALID [2022-04-15 05:00:34,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {2957#(= main_~lk3~0 1)} [248] L121-->L156-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[] {2953#false} is VALID [2022-04-15 05:00:34,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2953#false} is VALID [2022-04-15 05:00:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:34,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:34,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308828287] [2022-04-15 05:00:34,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308828287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:34,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:34,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241233857] [2022-04-15 05:00:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:34,088 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-15 05:00:34,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:34,088 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-15 05:00:34,106 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-15 05:00:34,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:34,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:34,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:34,108 INFO L87 Difference]: Start difference. First operand 137 states and 235 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-15 05:00:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,295 INFO L93 Difference]: Finished difference Result 253 states and 441 transitions. [2022-04-15 05:00:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:34,295 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-15 05:00:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:34,296 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-15 05:00:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 05:00:34,298 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-15 05:00:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 05:00:34,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 05:00:34,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:34,398 INFO L225 Difference]: With dead ends: 253 [2022-04-15 05:00:34,398 INFO L226 Difference]: Without dead ends: 251 [2022-04-15 05:00:34,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:34,399 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:34,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-15 05:00:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2022-04-15 05:00:34,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:34,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,407 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,408 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,416 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-15 05:00:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-15 05:00:34,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:34,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:34,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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 251 states. [2022-04-15 05:00:34,418 INFO L87 Difference]: Start difference. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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 251 states. [2022-04-15 05:00:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,425 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-15 05:00:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-15 05:00:34,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:34,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:34,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:34,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 315 transitions. [2022-04-15 05:00:34,431 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 315 transitions. Word has length 23 [2022-04-15 05:00:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:34,432 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 315 transitions. [2022-04-15 05:00:34,432 INFO L479 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-15 05:00:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 315 transitions. [2022-04-15 05:00:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:00:34,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:34,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:34,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 05:00:34,447 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 145145524, now seen corresponding path program 1 times [2022-04-15 05:00:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:34,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785370573] [2022-04-15 05:00:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3930#true} is VALID [2022-04-15 05:00:34,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {3930#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-15 05:00:34,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3930#true} {3930#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-15 05:00:34,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {3930#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:34,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {3936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3930#true} is VALID [2022-04-15 05:00:34,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {3930#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-15 05:00:34,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3930#true} {3930#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-15 05:00:34,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {3930#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#true} is VALID [2022-04-15 05:00:34,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {3930#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3930#true} is VALID [2022-04-15 05:00:34,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {3930#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {3930#true} is VALID [2022-04-15 05:00:34,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {3930#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3930#true} is VALID [2022-04-15 05:00:34,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {3930#true} [217] L68-->L68-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[] {3930#true} is VALID [2022-04-15 05:00:34,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {3930#true} [219] L68-2-->L72-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[] {3930#true} is VALID [2022-04-15 05:00:34,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {3930#true} [221] L72-1-->L76-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[] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {3935#(= main_~p3~0 0)} [222] L76-1-->L80-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] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {3935#(= main_~p3~0 0)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {3935#(= main_~p3~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {3935#(= main_~p3~0 0)} [228] L88-1-->L92-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] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {3935#(= main_~p3~0 0)} [230] L92-1-->L96-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] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {3935#(= main_~p3~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {3935#(= main_~p3~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {3935#(= main_~p3~0 0)} [237] L104-1-->L110-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[] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {3935#(= main_~p3~0 0)} [241] L110-1-->L115-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[] {3935#(= main_~p3~0 0)} is VALID [2022-04-15 05:00:34,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {3935#(= main_~p3~0 0)} [246] L115-1-->L121: 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[] {3931#false} is VALID [2022-04-15 05:00:34,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {3931#false} [248] L121-->L156-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[] {3931#false} is VALID [2022-04-15 05:00:34,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {3931#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#false} is VALID [2022-04-15 05:00:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:34,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785370573] [2022-04-15 05:00:34,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785370573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:34,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:34,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109060438] [2022-04-15 05:00:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:34,505 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-15 05:00:34,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:34,505 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-15 05:00:34,524 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-15 05:00:34,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:34,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:34,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:34,525 INFO L87 Difference]: Start difference. First operand 185 states and 315 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-15 05:00:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,706 INFO L93 Difference]: Finished difference Result 433 states and 745 transitions. [2022-04-15 05:00:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:34,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-15 05:00:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:34,707 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-15 05:00:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 05:00:34,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-15 05:00:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-15 05:00:34,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-15 05:00:34,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:34,852 INFO L225 Difference]: With dead ends: 433 [2022-04-15 05:00:34,853 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 05:00:34,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:34,857 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:34,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 05:00:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-15 05:00:34,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:34,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,872 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,875 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,882 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-15 05:00:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-15 05:00:34,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:34,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:34,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 05:00:34,885 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-15 05:00:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:34,891 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-15 05:00:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-15 05:00:34,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:34,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:34,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:34,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 435 transitions. [2022-04-15 05:00:34,914 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 435 transitions. Word has length 23 [2022-04-15 05:00:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:34,915 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 435 transitions. [2022-04-15 05:00:34,915 INFO L479 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-15 05:00:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 435 transitions. [2022-04-15 05:00:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:34,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:34,918 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:34,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 05:00:34,919 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 710134838, now seen corresponding path program 1 times [2022-04-15 05:00:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726537538] [2022-04-15 05:00:34,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:34,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5184#true} is VALID [2022-04-15 05:00:34,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {5184#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-15 05:00:34,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5184#true} {5184#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {5184#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:34,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {5190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {5184#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5184#true} {5184#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {5184#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {5184#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5184#true} is VALID [2022-04-15 05:00:34,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {5184#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {5184#true} is VALID [2022-04-15 05:00:34,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {5184#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {5184#true} is VALID [2022-04-15 05:00:34,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {5184#true} [217] L68-->L68-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[] {5184#true} is VALID [2022-04-15 05:00:34,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {5184#true} [219] L68-2-->L72-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[] {5184#true} is VALID [2022-04-15 05:00:34,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {5184#true} [220] L72-1-->L76-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] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {5189#(not (= main_~p3~0 0))} [222] L76-1-->L80-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] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {5189#(not (= main_~p3~0 0))} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {5189#(not (= main_~p3~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(not (= main_~p3~0 0))} [228] L88-1-->L92-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] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(not (= main_~p3~0 0))} [230] L92-1-->L96-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] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {5189#(not (= main_~p3~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {5189#(not (= main_~p3~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {5189#(not (= main_~p3~0 0))} [237] L104-1-->L110-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[] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {5189#(not (= main_~p3~0 0))} [241] L110-1-->L115-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[] {5189#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:00:34,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {5189#(not (= main_~p3~0 0))} [247] L115-1-->L120-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[] {5185#false} is VALID [2022-04-15 05:00:34,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {5185#false} [250] L120-1-->L126: 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[] {5185#false} is VALID [2022-04-15 05:00:34,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {5185#false} [252] L126-->L156-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[] {5185#false} is VALID [2022-04-15 05:00:34,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {5185#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5185#false} is VALID [2022-04-15 05:00:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726537538] [2022-04-15 05:00:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726537538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:34,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:34,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501109177] [2022-04-15 05:00:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:34,994 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-15 05:00:34,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:34,994 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-15 05:00:35,010 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-15 05:00:35,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:35,011 INFO L87 Difference]: Start difference. First operand 257 states and 435 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-15 05:00:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,186 INFO L93 Difference]: Finished difference Result 385 states and 649 transitions. [2022-04-15 05:00:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:35,186 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-15 05:00:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:35,187 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-15 05:00:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 05:00:35,189 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-15 05:00:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-15 05:00:35,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-15 05:00:35,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:35,337 INFO L225 Difference]: With dead ends: 385 [2022-04-15 05:00:35,337 INFO L226 Difference]: Without dead ends: 263 [2022-04-15 05:00:35,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:35,338 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:35,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-15 05:00:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-15 05:00:35,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:35,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,346 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,347 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,353 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-15 05:00:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-15 05:00:35,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:35,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:35,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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 263 states. [2022-04-15 05:00:35,355 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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 263 states. [2022-04-15 05:00:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,362 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-15 05:00:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-15 05:00:35,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:35,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:35,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:35,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2022-04-15 05:00:35,369 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 24 [2022-04-15 05:00:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:35,369 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2022-04-15 05:00:35,369 INFO L479 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-15 05:00:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2022-04-15 05:00:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:35,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:35,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:35,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 05:00:35,370 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash 204576213, now seen corresponding path program 1 times [2022-04-15 05:00:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283630677] [2022-04-15 05:00:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:35,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:35,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6402#true} is VALID [2022-04-15 05:00:35,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6402#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-15 05:00:35,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6402#true} {6402#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-15 05:00:35,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {6402#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:35,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {6408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6402#true} is VALID [2022-04-15 05:00:35,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {6402#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-15 05:00:35,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6402#true} {6402#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {6402#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {6402#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {6402#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {6402#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {6402#true} [217] L68-->L68-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[] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {6402#true} [219] L68-2-->L72-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[] {6402#true} is VALID [2022-04-15 05:00:35,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {6402#true} [221] L72-1-->L76-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[] {6402#true} is VALID [2022-04-15 05:00:35,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {6402#true} [222] L76-1-->L80-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] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {6407#(= main_~lk4~0 1)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {6407#(= main_~lk4~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {6407#(= main_~lk4~0 1)} [228] L88-1-->L92-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] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {6407#(= main_~lk4~0 1)} [230] L92-1-->L96-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] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {6407#(= main_~lk4~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {6407#(= main_~lk4~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {6407#(= main_~lk4~0 1)} [237] L104-1-->L110-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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {6407#(= main_~lk4~0 1)} [241] L110-1-->L115-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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {6407#(= main_~lk4~0 1)} [247] L115-1-->L120-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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {6407#(= main_~lk4~0 1)} [250] L120-1-->L126: 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[] {6407#(= main_~lk4~0 1)} is VALID [2022-04-15 05:00:35,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {6407#(= main_~lk4~0 1)} [252] L126-->L156-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[] {6403#false} is VALID [2022-04-15 05:00:35,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {6403#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6403#false} is VALID [2022-04-15 05:00:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:35,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283630677] [2022-04-15 05:00:35,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283630677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:35,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:35,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149710588] [2022-04-15 05:00:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:35,421 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-15 05:00:35,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:35,422 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-15 05:00:35,439 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-15 05:00:35,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:35,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:35,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:35,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:35,440 INFO L87 Difference]: Start difference. First operand 261 states and 435 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-15 05:00:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,611 INFO L93 Difference]: Finished difference Result 477 states and 809 transitions. [2022-04-15 05:00:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:35,612 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-15 05:00:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:35,612 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-15 05:00:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 05:00:35,613 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-15 05:00:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-15 05:00:35,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-15 05:00:35,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:35,732 INFO L225 Difference]: With dead ends: 477 [2022-04-15 05:00:35,732 INFO L226 Difference]: Without dead ends: 475 [2022-04-15 05:00:35,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:35,733 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:35,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-15 05:00:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-15 05:00:35,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:35,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,744 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,746 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,762 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-15 05:00:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-15 05:00:35,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:35,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:35,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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 475 states. [2022-04-15 05:00:35,765 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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 475 states. [2022-04-15 05:00:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:35,782 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-15 05:00:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-15 05:00:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:35,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:35,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:35,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 591 transitions. [2022-04-15 05:00:35,811 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 591 transitions. Word has length 24 [2022-04-15 05:00:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:35,811 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 591 transitions. [2022-04-15 05:00:35,811 INFO L479 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-15 05:00:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 591 transitions. [2022-04-15 05:00:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:00:35,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:35,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:35,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 05:00:35,813 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -88826794, now seen corresponding path program 1 times [2022-04-15 05:00:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:35,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336802382] [2022-04-15 05:00:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:35,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8240#true} is VALID [2022-04-15 05:00:35,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {8240#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-15 05:00:35,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8240#true} {8240#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-15 05:00:35,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {8240#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:35,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {8246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8240#true} is VALID [2022-04-15 05:00:35,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {8240#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-15 05:00:35,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8240#true} {8240#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-15 05:00:35,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {8240#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {8240#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {8240#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {8240#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {8240#true} [217] L68-->L68-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[] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {8240#true} [219] L68-2-->L72-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[] {8240#true} is VALID [2022-04-15 05:00:35,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {8240#true} [221] L72-1-->L76-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[] {8240#true} is VALID [2022-04-15 05:00:35,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {8240#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {8245#(= main_~p4~0 0)} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {8245#(= main_~p4~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {8245#(= main_~p4~0 0)} [228] L88-1-->L92-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] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {8245#(= main_~p4~0 0)} [230] L92-1-->L96-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] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {8245#(= main_~p4~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {8245#(= main_~p4~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {8245#(= main_~p4~0 0)} [237] L104-1-->L110-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {8245#(= main_~p4~0 0)} [241] L110-1-->L115-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {8245#(= main_~p4~0 0)} [247] L115-1-->L120-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[] {8245#(= main_~p4~0 0)} is VALID [2022-04-15 05:00:35,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {8245#(= main_~p4~0 0)} [250] L120-1-->L126: 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[] {8241#false} is VALID [2022-04-15 05:00:35,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#false} [252] L126-->L156-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[] {8241#false} is VALID [2022-04-15 05:00:35,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {8241#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8241#false} is VALID [2022-04-15 05:00:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:35,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336802382] [2022-04-15 05:00:35,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336802382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:35,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:35,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700460233] [2022-04-15 05:00:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:35,894 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-15 05:00:35,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:35,895 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-15 05:00:35,911 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-15 05:00:35,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:35,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:35,912 INFO L87 Difference]: Start difference. First operand 361 states and 591 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-15 05:00:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,210 INFO L93 Difference]: Finished difference Result 845 states and 1393 transitions. [2022-04-15 05:00:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:36,210 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-15 05:00:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:36,211 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-15 05:00:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 05:00:36,214 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-15 05:00:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-15 05:00:36,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-15 05:00:36,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:36,357 INFO L225 Difference]: With dead ends: 845 [2022-04-15 05:00:36,357 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 05:00:36,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:36,359 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:36,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 05:00:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-15 05:00:36,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:36,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,374 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,375 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,392 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-15 05:00:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-15 05:00:36,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:36,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:36,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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 499 states. [2022-04-15 05:00:36,395 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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 499 states. [2022-04-15 05:00:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,412 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-15 05:00:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-15 05:00:36,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:36,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:36,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:36,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 807 transitions. [2022-04-15 05:00:36,431 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 807 transitions. Word has length 24 [2022-04-15 05:00:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:36,431 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 807 transitions. [2022-04-15 05:00:36,431 INFO L479 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-15 05:00:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 807 transitions. [2022-04-15 05:00:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:36,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:36,433 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:36,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 05:00:36,433 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2046927696, now seen corresponding path program 1 times [2022-04-15 05:00:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:36,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929256279] [2022-04-15 05:00:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:36,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10646#true} is VALID [2022-04-15 05:00:36,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {10646#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-15 05:00:36,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10646#true} {10646#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-15 05:00:36,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {10646#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:36,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {10652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10646#true} is VALID [2022-04-15 05:00:36,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {10646#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-15 05:00:36,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10646#true} {10646#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-15 05:00:36,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {10646#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10646#true} is VALID [2022-04-15 05:00:36,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {10646#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {10646#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {10646#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {10646#true} [217] L68-->L68-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[] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {10646#true} [219] L68-2-->L72-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[] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {10646#true} [221] L72-1-->L76-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[] {10646#true} is VALID [2022-04-15 05:00:36,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {10646#true} [222] L76-1-->L80-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] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {10651#(not (= main_~p4~0 0))} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {10651#(not (= main_~p4~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {10651#(not (= main_~p4~0 0))} [228] L88-1-->L92-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] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {10651#(not (= main_~p4~0 0))} [230] L92-1-->L96-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] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {10651#(not (= main_~p4~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {10651#(not (= main_~p4~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(not (= main_~p4~0 0))} [237] L104-1-->L110-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[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(not (= main_~p4~0 0))} [241] L110-1-->L115-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[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {10651#(not (= main_~p4~0 0))} [247] L115-1-->L120-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[] {10651#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:00:36,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {10651#(not (= main_~p4~0 0))} [251] L120-1-->L125-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[] {10647#false} is VALID [2022-04-15 05:00:36,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {10647#false} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-15 05:00:36,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {10647#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-15 05:00:36,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {10647#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#false} is VALID [2022-04-15 05:00:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929256279] [2022-04-15 05:00:36,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929256279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:36,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:36,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092286257] [2022-04-15 05:00:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:36,493 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-15 05:00:36,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:36,494 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-15 05:00:36,511 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-15 05:00:36,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:36,513 INFO L87 Difference]: Start difference. First operand 497 states and 807 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-15 05:00:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,723 INFO L93 Difference]: Finished difference Result 745 states and 1205 transitions. [2022-04-15 05:00:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:36,723 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-15 05:00:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:36,724 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-15 05:00:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 05:00:36,726 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-15 05:00:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-15 05:00:36,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-15 05:00:36,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:36,882 INFO L225 Difference]: With dead ends: 745 [2022-04-15 05:00:36,882 INFO L226 Difference]: Without dead ends: 507 [2022-04-15 05:00:36,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:36,883 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:36,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-15 05:00:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-15 05:00:36,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:36,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,896 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,897 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,913 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-15 05:00:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-15 05:00:36,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:36,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:36,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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 507 states. [2022-04-15 05:00:36,916 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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 507 states. [2022-04-15 05:00:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:36,932 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-15 05:00:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-15 05:00:36,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:36,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:36,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:36,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 807 transitions. [2022-04-15 05:00:36,950 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 807 transitions. Word has length 25 [2022-04-15 05:00:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:36,951 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 807 transitions. [2022-04-15 05:00:36,951 INFO L479 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-15 05:00:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 807 transitions. [2022-04-15 05:00:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:36,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:36,952 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:36,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 05:00:36,952 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1541369071, now seen corresponding path program 1 times [2022-04-15 05:00:36,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:36,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809357015] [2022-04-15 05:00:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:36,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {12976#true} is VALID [2022-04-15 05:00:36,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {12976#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12976#true} {12976#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {12976#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:36,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {12982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {12976#true} is VALID [2022-04-15 05:00:36,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {12976#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12976#true} {12976#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {12976#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {12976#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {12976#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {12976#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#true} [217] L68-->L68-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[] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {12976#true} [219] L68-2-->L72-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[] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {12976#true} [221] L72-1-->L76-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[] {12976#true} is VALID [2022-04-15 05:00:36,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {12976#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {12976#true} is VALID [2022-04-15 05:00:36,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#true} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:36,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {12981#(= main_~lk5~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:36,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {12981#(= main_~lk5~0 1)} [228] L88-1-->L92-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] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:36,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {12981#(= main_~lk5~0 1)} [230] L92-1-->L96-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] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:36,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {12981#(= main_~lk5~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {12981#(= main_~lk5~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {12981#(= main_~lk5~0 1)} [237] L104-1-->L110-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {12981#(= main_~lk5~0 1)} [241] L110-1-->L115-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {12981#(= main_~lk5~0 1)} [247] L115-1-->L120-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {12981#(= main_~lk5~0 1)} [251] L120-1-->L125-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[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {12981#(= main_~lk5~0 1)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {12981#(= main_~lk5~0 1)} is VALID [2022-04-15 05:00:37,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {12981#(= main_~lk5~0 1)} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {12977#false} is VALID [2022-04-15 05:00:37,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {12977#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12977#false} is VALID [2022-04-15 05:00:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809357015] [2022-04-15 05:00:37,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809357015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:37,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:37,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:37,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412190113] [2022-04-15 05:00:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:37,011 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-15 05:00:37,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:37,011 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-15 05:00:37,043 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-15 05:00:37,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:37,045 INFO L87 Difference]: Start difference. First operand 505 states and 807 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-15 05:00:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:37,262 INFO L93 Difference]: Finished difference Result 909 states and 1481 transitions. [2022-04-15 05:00:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:37,263 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-15 05:00:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:37,263 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-15 05:00:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 05:00:37,264 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-15 05:00:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 05:00:37,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 05:00:37,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:37,400 INFO L225 Difference]: With dead ends: 909 [2022-04-15 05:00:37,400 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 05:00:37,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:37,402 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:37,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 05:00:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-15 05:00:37,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:37,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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-15 05:00:37,420 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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-15 05:00:37,420 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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-15 05:00:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:37,489 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-15 05:00:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-15 05:00:37,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:37,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:37,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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 907 states. [2022-04-15 05:00:37,492 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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 907 states. [2022-04-15 05:00:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:37,537 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-15 05:00:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-15 05:00:37,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:37,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:37,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:37,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 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-15 05:00:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1111 transitions. [2022-04-15 05:00:37,568 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1111 transitions. Word has length 25 [2022-04-15 05:00:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:37,568 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1111 transitions. [2022-04-15 05:00:37,568 INFO L479 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-15 05:00:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1111 transitions. [2022-04-15 05:00:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:00:37,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:37,570 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:37,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 05:00:37,570 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1247966064, now seen corresponding path program 1 times [2022-04-15 05:00:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:37,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82510444] [2022-04-15 05:00:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:37,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {16486#true} is VALID [2022-04-15 05:00:37,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {16486#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16486#true} {16486#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {16486#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:37,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {16492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {16486#true} is VALID [2022-04-15 05:00:37,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {16486#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16486#true} {16486#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {16486#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {16486#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {16486#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {16486#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {16486#true} [217] L68-->L68-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[] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {16486#true} [219] L68-2-->L72-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[] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {16486#true} [221] L72-1-->L76-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[] {16486#true} is VALID [2022-04-15 05:00:37,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {16486#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {16486#true} is VALID [2022-04-15 05:00:37,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {16486#true} [225] L80-1-->L84-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {16491#(= main_~p5~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {16491#(= main_~p5~0 0)} [228] L88-1-->L92-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] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {16491#(= main_~p5~0 0)} [230] L92-1-->L96-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] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {16491#(= main_~p5~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {16491#(= main_~p5~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {16491#(= main_~p5~0 0)} [237] L104-1-->L110-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {16491#(= main_~p5~0 0)} [241] L110-1-->L115-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {16491#(= main_~p5~0 0)} [247] L115-1-->L120-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {16491#(= main_~p5~0 0)} [251] L120-1-->L125-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[] {16491#(= main_~p5~0 0)} is VALID [2022-04-15 05:00:37,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {16491#(= main_~p5~0 0)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-15 05:00:37,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {16487#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-15 05:00:37,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {16487#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16487#false} is VALID [2022-04-15 05:00:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:37,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82510444] [2022-04-15 05:00:37,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82510444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:37,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:37,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114220747] [2022-04-15 05:00:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:37,629 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-15 05:00:37,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:37,629 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-15 05:00:37,645 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-15 05:00:37,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:37,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:37,646 INFO L87 Difference]: Start difference. First operand 713 states and 1111 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-15 05:00:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:37,978 INFO L93 Difference]: Finished difference Result 1661 states and 2601 transitions. [2022-04-15 05:00:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:37,978 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-15 05:00:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:37,979 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-15 05:00:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 05:00:37,980 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-15 05:00:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-15 05:00:37,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-15 05:00:38,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:38,164 INFO L225 Difference]: With dead ends: 1661 [2022-04-15 05:00:38,164 INFO L226 Difference]: Without dead ends: 971 [2022-04-15 05:00:38,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:38,166 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:38,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-15 05:00:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-15 05:00:38,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:38,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,190 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,191 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:38,240 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-15 05:00:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-15 05:00:38,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:38,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:38,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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 971 states. [2022-04-15 05:00:38,246 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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 971 states. [2022-04-15 05:00:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:38,294 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-15 05:00:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-15 05:00:38,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:38,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:38,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:38,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1495 transitions. [2022-04-15 05:00:38,350 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1495 transitions. Word has length 25 [2022-04-15 05:00:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:38,350 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1495 transitions. [2022-04-15 05:00:38,350 INFO L479 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-15 05:00:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1495 transitions. [2022-04-15 05:00:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:38,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:38,353 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:38,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 05:00:38,354 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 537833458, now seen corresponding path program 1 times [2022-04-15 05:00:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896633902] [2022-04-15 05:00:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:38,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:38,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21164#true} is VALID [2022-04-15 05:00:38,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21164#true} {21164#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {21164#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:38,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {21170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21164#true} is VALID [2022-04-15 05:00:38,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21164#true} {21164#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {21164#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {21164#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {21164#true} is VALID [2022-04-15 05:00:38,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {21164#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {21164#true} is VALID [2022-04-15 05:00:38,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {21164#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {21164#true} is VALID [2022-04-15 05:00:38,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {21164#true} [217] L68-->L68-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[] {21164#true} is VALID [2022-04-15 05:00:38,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {21164#true} [219] L68-2-->L72-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[] {21164#true} is VALID [2022-04-15 05:00:38,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {21164#true} [221] L72-1-->L76-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[] {21164#true} is VALID [2022-04-15 05:00:38,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {21164#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {21164#true} is VALID [2022-04-15 05:00:38,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {21164#true} [224] L80-1-->L84-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {21169#(not (= main_~p5~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {21169#(not (= main_~p5~0 0))} [228] L88-1-->L92-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] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {21169#(not (= main_~p5~0 0))} [230] L92-1-->L96-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] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {21169#(not (= main_~p5~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {21169#(not (= main_~p5~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {21169#(not (= main_~p5~0 0))} [237] L104-1-->L110-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {21169#(not (= main_~p5~0 0))} [241] L110-1-->L115-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {21169#(not (= main_~p5~0 0))} [247] L115-1-->L120-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {21169#(not (= main_~p5~0 0))} [251] L120-1-->L125-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[] {21169#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:00:38,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {21169#(not (= main_~p5~0 0))} [255] L125-1-->L130-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[] {21165#false} is VALID [2022-04-15 05:00:38,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {21165#false} [258] L130-1-->L136: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {21165#false} is VALID [2022-04-15 05:00:38,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {21165#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {21165#false} is VALID [2022-04-15 05:00:38,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {21165#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21165#false} is VALID [2022-04-15 05:00:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896633902] [2022-04-15 05:00:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896633902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:38,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252174603] [2022-04-15 05:00:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:38,402 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-15 05:00:38,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:38,403 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-15 05:00:38,419 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-15 05:00:38,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:38,420 INFO L87 Difference]: Start difference. First operand 969 states and 1495 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-15 05:00:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:38,729 INFO L93 Difference]: Finished difference Result 1453 states and 2233 transitions. [2022-04-15 05:00:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:38,730 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-15 05:00:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:38,730 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-15 05:00:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 05:00:38,733 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-15 05:00:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 05:00:38,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 05:00:38,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:38,914 INFO L225 Difference]: With dead ends: 1453 [2022-04-15 05:00:38,914 INFO L226 Difference]: Without dead ends: 987 [2022-04-15 05:00:38,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:38,918 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:38,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-15 05:00:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-15 05:00:38,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:38,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,943 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,944 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:38,993 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-15 05:00:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-15 05:00:38,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:38,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:38,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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 987 states. [2022-04-15 05:00:38,998 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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 987 states. [2022-04-15 05:00:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:39,046 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-15 05:00:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-15 05:00:39,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:39,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:39,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:39,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1495 transitions. [2022-04-15 05:00:39,098 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1495 transitions. Word has length 26 [2022-04-15 05:00:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:39,099 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1495 transitions. [2022-04-15 05:00:39,099 INFO L479 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-15 05:00:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1495 transitions. [2022-04-15 05:00:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:39,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:39,101 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:39,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 05:00:39,101 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash 32274833, now seen corresponding path program 1 times [2022-04-15 05:00:39,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:39,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711827111] [2022-04-15 05:00:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:39,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25682#true} is VALID [2022-04-15 05:00:39,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {25682#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25682#true} {25682#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {25682#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:39,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {25688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25682#true} is VALID [2022-04-15 05:00:39,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {25682#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25682#true} {25682#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {25682#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {25682#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {25682#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {25682#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {25682#true} [217] L68-->L68-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[] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {25682#true} [219] L68-2-->L72-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[] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {25682#true} [221] L72-1-->L76-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[] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {25682#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {25682#true} is VALID [2022-04-15 05:00:39,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {25682#true} [225] L80-1-->L84-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[] {25682#true} is VALID [2022-04-15 05:00:39,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {25682#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {25687#(= main_~lk6~0 1)} [228] L88-1-->L92-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] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {25687#(= main_~lk6~0 1)} [230] L92-1-->L96-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] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {25687#(= main_~lk6~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {25687#(= main_~lk6~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {25687#(= main_~lk6~0 1)} [237] L104-1-->L110-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {25687#(= main_~lk6~0 1)} [241] L110-1-->L115-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {25687#(= main_~lk6~0 1)} [247] L115-1-->L120-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {25687#(= main_~lk6~0 1)} [251] L120-1-->L125-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {25687#(= main_~lk6~0 1)} [255] L125-1-->L130-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[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {25687#(= main_~lk6~0 1)} [258] L130-1-->L136: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {25687#(= main_~lk6~0 1)} is VALID [2022-04-15 05:00:39,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {25687#(= main_~lk6~0 1)} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {25683#false} is VALID [2022-04-15 05:00:39,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {25683#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25683#false} is VALID [2022-04-15 05:00:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711827111] [2022-04-15 05:00:39,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711827111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:39,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:39,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:39,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181206344] [2022-04-15 05:00:39,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:39,185 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-15 05:00:39,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:39,185 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-15 05:00:39,203 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-15 05:00:39,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:39,204 INFO L87 Difference]: Start difference. First operand 985 states and 1495 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-15 05:00:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:39,543 INFO L93 Difference]: Finished difference Result 1741 states and 2697 transitions. [2022-04-15 05:00:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:39,544 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-15 05:00:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:39,544 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-15 05:00:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 05:00:39,545 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-15 05:00:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 05:00:39,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 05:00:39,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:39,739 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 05:00:39,739 INFO L226 Difference]: Without dead ends: 1739 [2022-04-15 05:00:39,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:39,741 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 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-15 05:00:39,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:00:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-15 05:00:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-15 05:00:39,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:39,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:39,774 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:39,776 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:39,919 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-15 05:00:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-15 05:00:39,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:39,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:39,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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 1739 states. [2022-04-15 05:00:39,926 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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 1739 states. [2022-04-15 05:00:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:40,066 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-15 05:00:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-15 05:00:40,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:40,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:40,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:40,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2087 transitions. [2022-04-15 05:00:40,179 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2087 transitions. Word has length 26 [2022-04-15 05:00:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:40,179 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2087 transitions. [2022-04-15 05:00:40,180 INFO L479 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-15 05:00:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2087 transitions. [2022-04-15 05:00:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:00:40,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:40,182 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:40,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 05:00:40,182 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -261128174, now seen corresponding path program 1 times [2022-04-15 05:00:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:40,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568582670] [2022-04-15 05:00:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:40,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32440#true} is VALID [2022-04-15 05:00:40,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {32440#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32440#true} {32440#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {32440#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:40,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {32446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32440#true} is VALID [2022-04-15 05:00:40,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {32440#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32440#true} {32440#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {32440#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {32440#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {32440#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {32440#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {32440#true} [217] L68-->L68-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[] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {32440#true} [219] L68-2-->L72-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[] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {32440#true} [221] L72-1-->L76-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[] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {32440#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {32440#true} is VALID [2022-04-15 05:00:40,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {32440#true} [225] L80-1-->L84-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[] {32440#true} is VALID [2022-04-15 05:00:40,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {32440#true} [227] L84-1-->L88-1: Formula: (= 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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {32445#(= main_~p6~0 0)} [228] L88-1-->L92-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] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {32445#(= main_~p6~0 0)} [230] L92-1-->L96-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] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {32445#(= main_~p6~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {32445#(= main_~p6~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {32445#(= main_~p6~0 0)} [237] L104-1-->L110-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {32445#(= main_~p6~0 0)} [241] L110-1-->L115-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {32445#(= main_~p6~0 0)} [247] L115-1-->L120-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {32445#(= main_~p6~0 0)} [251] L120-1-->L125-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {32445#(= main_~p6~0 0)} [255] L125-1-->L130-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[] {32445#(= main_~p6~0 0)} is VALID [2022-04-15 05:00:40,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {32445#(= main_~p6~0 0)} [258] L130-1-->L136: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {32441#false} is VALID [2022-04-15 05:00:40,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {32441#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {32441#false} is VALID [2022-04-15 05:00:40,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {32441#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32441#false} is VALID [2022-04-15 05:00:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:40,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568582670] [2022-04-15 05:00:40,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568582670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:40,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:40,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906417411] [2022-04-15 05:00:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:40,235 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-15 05:00:40,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:40,236 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-15 05:00:40,252 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-15 05:00:40,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:40,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:40,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:40,253 INFO L87 Difference]: Start difference. First operand 1417 states and 2087 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-15 05:00:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:40,946 INFO L93 Difference]: Finished difference Result 3277 states and 4841 transitions. [2022-04-15 05:00:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:40,946 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-15 05:00:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:40,947 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-15 05:00:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 05:00:40,950 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-15 05:00:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-15 05:00:40,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-15 05:00:41,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:41,261 INFO L225 Difference]: With dead ends: 3277 [2022-04-15 05:00:41,261 INFO L226 Difference]: Without dead ends: 1899 [2022-04-15 05:00:41,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:41,266 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:41,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-15 05:00:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-15 05:00:41,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:41,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:41,355 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:41,358 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:41,522 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-15 05:00:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-15 05:00:41,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:41,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:41,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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 1899 states. [2022-04-15 05:00:41,531 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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 1899 states. [2022-04-15 05:00:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:41,663 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-15 05:00:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-15 05:00:41,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:41,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:41,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:41,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2759 transitions. [2022-04-15 05:00:41,857 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2759 transitions. Word has length 26 [2022-04-15 05:00:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:41,857 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2759 transitions. [2022-04-15 05:00:41,857 INFO L479 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-15 05:00:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2759 transitions. [2022-04-15 05:00:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:41,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:41,860 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:41,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 05:00:41,861 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1000552460, now seen corresponding path program 1 times [2022-04-15 05:00:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:41,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000108738] [2022-04-15 05:00:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:41,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41598#true} is VALID [2022-04-15 05:00:41,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {41598#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41598#true} {41598#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {41598#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:41,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {41604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {41598#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41598#true} {41598#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {41598#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {41598#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {41598#true} is VALID [2022-04-15 05:00:41,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {41598#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {41598#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {41598#true} [217] L68-->L68-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[] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {41598#true} [219] L68-2-->L72-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[] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {41598#true} [221] L72-1-->L76-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[] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {41598#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {41598#true} is VALID [2022-04-15 05:00:41,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {41598#true} [225] L80-1-->L84-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[] {41598#true} is VALID [2022-04-15 05:00:41,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {41598#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {41603#(not (= main_~p6~0 0))} [228] L88-1-->L92-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] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {41603#(not (= main_~p6~0 0))} [230] L92-1-->L96-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] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {41603#(not (= main_~p6~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {41603#(not (= main_~p6~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {41603#(not (= main_~p6~0 0))} [237] L104-1-->L110-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {41603#(not (= main_~p6~0 0))} [241] L110-1-->L115-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {41603#(not (= main_~p6~0 0))} [247] L115-1-->L120-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {41603#(not (= main_~p6~0 0))} [251] L120-1-->L125-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {41603#(not (= main_~p6~0 0))} [255] L125-1-->L130-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[] {41603#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:00:41,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {41603#(not (= main_~p6~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-15 05:00:41,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {41599#false} [262] L135-1-->L141: 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[] {41599#false} is VALID [2022-04-15 05:00:41,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {41599#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-15 05:00:41,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {41599#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41599#false} is VALID [2022-04-15 05:00:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:41,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000108738] [2022-04-15 05:00:41,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000108738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:41,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:41,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976353006] [2022-04-15 05:00:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:41,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:41,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:41,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:41,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:41,918 INFO L87 Difference]: Start difference. First operand 1897 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:42,471 INFO L93 Difference]: Finished difference Result 2845 states and 4121 transitions. [2022-04-15 05:00:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 05:00:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 05:00:42,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 05:00:42,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:42,773 INFO L225 Difference]: With dead ends: 2845 [2022-04-15 05:00:42,773 INFO L226 Difference]: Without dead ends: 1931 [2022-04-15 05:00:42,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:42,776 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:42,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-15 05:00:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-15 05:00:42,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:42,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,821 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,824 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:42,986 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-15 05:00:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-15 05:00:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:42,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:42,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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 1931 states. [2022-04-15 05:00:42,995 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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 1931 states. [2022-04-15 05:00:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:43,157 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-15 05:00:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-15 05:00:43,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:43,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:43,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:43,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2759 transitions. [2022-04-15 05:00:43,348 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2759 transitions. Word has length 27 [2022-04-15 05:00:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:43,348 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2759 transitions. [2022-04-15 05:00:43,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2759 transitions. [2022-04-15 05:00:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:43,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:43,350 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:43,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 05:00:43,351 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 494993835, now seen corresponding path program 1 times [2022-04-15 05:00:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516473825] [2022-04-15 05:00:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:43,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:43,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {50420#true} is VALID [2022-04-15 05:00:43,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {50420#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50420#true} {50420#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {50420#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:43,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {50426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {50420#true} is VALID [2022-04-15 05:00:43,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {50420#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50420#true} {50420#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {50420#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {50420#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {50420#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {50420#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {50420#true} [217] L68-->L68-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[] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {50420#true} [219] L68-2-->L72-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[] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {50420#true} [221] L72-1-->L76-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[] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {50420#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {50420#true} [225] L80-1-->L84-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[] {50420#true} is VALID [2022-04-15 05:00:43,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {50420#true} [227] L84-1-->L88-1: Formula: (= 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[] {50420#true} is VALID [2022-04-15 05:00:43,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {50420#true} [228] L88-1-->L92-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] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {50425#(= main_~lk7~0 1)} [230] L92-1-->L96-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] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {50425#(= main_~lk7~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {50425#(= main_~lk7~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {50425#(= main_~lk7~0 1)} [237] L104-1-->L110-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {50425#(= main_~lk7~0 1)} [241] L110-1-->L115-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {50425#(= main_~lk7~0 1)} [247] L115-1-->L120-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {50425#(= main_~lk7~0 1)} [251] L120-1-->L125-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {50425#(= main_~lk7~0 1)} [255] L125-1-->L130-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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {50425#(= main_~lk7~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {50425#(= main_~lk7~0 1)} [262] L135-1-->L141: 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[] {50425#(= main_~lk7~0 1)} is VALID [2022-04-15 05:00:43,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {50425#(= main_~lk7~0 1)} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {50421#false} is VALID [2022-04-15 05:00:43,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {50421#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50421#false} is VALID [2022-04-15 05:00:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516473825] [2022-04-15 05:00:43,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516473825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:43,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:43,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262953075] [2022-04-15 05:00:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:43,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:43,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:43,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:43,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:43,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:43,444 INFO L87 Difference]: Start difference. First operand 1929 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:44,137 INFO L93 Difference]: Finished difference Result 3341 states and 4873 transitions. [2022-04-15 05:00:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 05:00:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-15 05:00:44,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-15 05:00:44,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:44,614 INFO L225 Difference]: With dead ends: 3341 [2022-04-15 05:00:44,615 INFO L226 Difference]: Without dead ends: 3339 [2022-04-15 05:00:44,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:44,617 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:44,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-15 05:00:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-15 05:00:44,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:44,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:44,687 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:44,690 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,161 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-15 05:00:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-15 05:00:45,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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 3339 states. [2022-04-15 05:00:45,176 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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 3339 states. [2022-04-15 05:00:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:45,648 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-15 05:00:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-15 05:00:45,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:45,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:45,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:45,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3911 transitions. [2022-04-15 05:00:46,020 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3911 transitions. Word has length 27 [2022-04-15 05:00:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:46,020 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 3911 transitions. [2022-04-15 05:00:46,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3911 transitions. [2022-04-15 05:00:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:00:46,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:46,023 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:46,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 05:00:46,023 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 201590828, now seen corresponding path program 1 times [2022-04-15 05:00:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:46,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544455061] [2022-04-15 05:00:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:46,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {63482#true} is VALID [2022-04-15 05:00:46,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {63482#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63482#true} {63482#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {63482#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:46,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {63488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {63482#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63482#true} {63482#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {63482#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {63482#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {63482#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {63482#true} is VALID [2022-04-15 05:00:46,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {63482#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {63482#true} [217] L68-->L68-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[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {63482#true} [219] L68-2-->L72-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[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {63482#true} [221] L72-1-->L76-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[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {63482#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {63482#true} [225] L80-1-->L84-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[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {63482#true} [227] L84-1-->L88-1: Formula: (= 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[] {63482#true} is VALID [2022-04-15 05:00:46,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {63482#true} [229] L88-1-->L92-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {63487#(= main_~p7~0 0)} [230] L92-1-->L96-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] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {63487#(= main_~p7~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {63487#(= main_~p7~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {63487#(= main_~p7~0 0)} [237] L104-1-->L110-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {63487#(= main_~p7~0 0)} [241] L110-1-->L115-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {63487#(= main_~p7~0 0)} [247] L115-1-->L120-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {63487#(= main_~p7~0 0)} [251] L120-1-->L125-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {63487#(= main_~p7~0 0)} [255] L125-1-->L130-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[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {63487#(= main_~p7~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {63487#(= main_~p7~0 0)} is VALID [2022-04-15 05:00:46,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {63487#(= main_~p7~0 0)} [262] L135-1-->L141: 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[] {63483#false} is VALID [2022-04-15 05:00:46,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {63483#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {63483#false} is VALID [2022-04-15 05:00:46,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {63483#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63483#false} is VALID [2022-04-15 05:00:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:46,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544455061] [2022-04-15 05:00:46,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544455061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:46,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:46,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949786954] [2022-04-15 05:00:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:46,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:46,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:46,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:46,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:46,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:46,088 INFO L87 Difference]: Start difference. First operand 2825 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:47,637 INFO L93 Difference]: Finished difference Result 6477 states and 8969 transitions. [2022-04-15 05:00:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-15 05:00:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 05:00:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-15 05:00:47,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-15 05:00:47,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:48,157 INFO L225 Difference]: With dead ends: 6477 [2022-04-15 05:00:48,157 INFO L226 Difference]: Without dead ends: 3723 [2022-04-15 05:00:48,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:48,167 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:48,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-15 05:00:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-15 05:00:48,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:48,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:48,279 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:48,286 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:48,967 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-15 05:00:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-15 05:00:48,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:48,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:48,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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 3723 states. [2022-04-15 05:00:48,979 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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 3723 states. [2022-04-15 05:00:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:49,425 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-15 05:00:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-15 05:00:49,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:49,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:49,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:49,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5063 transitions. [2022-04-15 05:00:49,982 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5063 transitions. Word has length 27 [2022-04-15 05:00:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:49,982 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5063 transitions. [2022-04-15 05:00:49,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5063 transitions. [2022-04-15 05:00:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:00:49,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:49,986 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:49,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 05:00:49,986 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1835027538, now seen corresponding path program 1 times [2022-04-15 05:00:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:49,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977295264] [2022-04-15 05:00:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:50,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {81472#true} is VALID [2022-04-15 05:00:50,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {81472#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81472#true} {81472#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {81472#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:50,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {81478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {81472#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81472#true} {81472#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {81472#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {81472#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {81472#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {81472#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {81472#true} [217] L68-->L68-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[] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {81472#true} [219] L68-2-->L72-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[] {81472#true} is VALID [2022-04-15 05:00:50,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {81472#true} [221] L72-1-->L76-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[] {81472#true} is VALID [2022-04-15 05:00:50,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {81472#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {81472#true} is VALID [2022-04-15 05:00:50,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {81472#true} [225] L80-1-->L84-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[] {81472#true} is VALID [2022-04-15 05:00:50,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {81472#true} [227] L84-1-->L88-1: Formula: (= 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[] {81472#true} is VALID [2022-04-15 05:00:50,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {81472#true} [228] L88-1-->L92-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] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {81477#(not (= main_~p7~0 0))} [230] L92-1-->L96-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] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {81477#(not (= main_~p7~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {81477#(not (= main_~p7~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {81477#(not (= main_~p7~0 0))} [237] L104-1-->L110-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {81477#(not (= main_~p7~0 0))} [241] L110-1-->L115-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {81477#(not (= main_~p7~0 0))} [247] L115-1-->L120-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {81477#(not (= main_~p7~0 0))} [251] L120-1-->L125-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {81477#(not (= main_~p7~0 0))} [255] L125-1-->L130-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[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {81477#(not (= main_~p7~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {81477#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:00:50,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {81477#(not (= main_~p7~0 0))} [263] L135-1-->L140-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[] {81473#false} is VALID [2022-04-15 05:00:50,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {81473#false} [266] L140-1-->L146: 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[] {81473#false} is VALID [2022-04-15 05:00:50,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {81473#false} [268] L146-->L156-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[] {81473#false} is VALID [2022-04-15 05:00:50,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {81473#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81473#false} is VALID [2022-04-15 05:00:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977295264] [2022-04-15 05:00:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977295264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:50,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473208494] [2022-04-15 05:00:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:00:50,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:50,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:50,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:50,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:50,075 INFO L87 Difference]: Start difference. First operand 3721 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:51,357 INFO L93 Difference]: Finished difference Result 5581 states and 7561 transitions. [2022-04-15 05:00:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:00:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 05:00:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-15 05:00:51,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-15 05:00:51,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:52,155 INFO L225 Difference]: With dead ends: 5581 [2022-04-15 05:00:52,155 INFO L226 Difference]: Without dead ends: 3787 [2022-04-15 05:00:52,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:52,159 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:52,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-15 05:00:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-15 05:00:52,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:52,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:52,247 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:52,253 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:52,847 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-15 05:00:52,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-15 05:00:52,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:52,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:52,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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 3787 states. [2022-04-15 05:00:52,858 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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 3787 states. [2022-04-15 05:00:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:53,364 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-15 05:00:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-15 05:00:53,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:53,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:53,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:53,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5063 transitions. [2022-04-15 05:00:53,869 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5063 transitions. Word has length 28 [2022-04-15 05:00:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:00:53,869 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5063 transitions. [2022-04-15 05:00:53,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5063 transitions. [2022-04-15 05:00:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:00:53,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:00:53,872 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:00:53,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 05:00:53,872 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:00:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:00:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1954381133, now seen corresponding path program 1 times [2022-04-15 05:00:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:00:53,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211033755] [2022-04-15 05:00:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:00:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:00:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:00:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:00:53,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98758#true} is VALID [2022-04-15 05:00:53,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {98758#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98758#true} {98758#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {98758#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:00:53,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {98764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98758#true} is VALID [2022-04-15 05:00:53,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {98758#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98758#true} {98758#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {98758#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {98758#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {98758#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {98758#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {98758#true} [217] L68-->L68-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[] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {98758#true} [219] L68-2-->L72-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[] {98758#true} is VALID [2022-04-15 05:00:53,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {98758#true} [221] L72-1-->L76-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[] {98758#true} is VALID [2022-04-15 05:00:53,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {98758#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {98758#true} is VALID [2022-04-15 05:00:53,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {98758#true} [225] L80-1-->L84-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[] {98758#true} is VALID [2022-04-15 05:00:53,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {98758#true} [227] L84-1-->L88-1: Formula: (= 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[] {98758#true} is VALID [2022-04-15 05:00:53,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {98758#true} [229] L88-1-->L92-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[] {98758#true} is VALID [2022-04-15 05:00:53,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {98758#true} [230] L92-1-->L96-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] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {98763#(= main_~lk8~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {98763#(= main_~lk8~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {98763#(= main_~lk8~0 1)} [237] L104-1-->L110-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {98763#(= main_~lk8~0 1)} [241] L110-1-->L115-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {98763#(= main_~lk8~0 1)} [247] L115-1-->L120-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {98763#(= main_~lk8~0 1)} [251] L120-1-->L125-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {98763#(= main_~lk8~0 1)} [255] L125-1-->L130-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {98763#(= main_~lk8~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {98763#(= main_~lk8~0 1)} [263] L135-1-->L140-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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {98763#(= main_~lk8~0 1)} [266] L140-1-->L146: 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[] {98763#(= main_~lk8~0 1)} is VALID [2022-04-15 05:00:53,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {98763#(= main_~lk8~0 1)} [268] L146-->L156-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[] {98759#false} is VALID [2022-04-15 05:00:53,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {98759#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98759#false} is VALID [2022-04-15 05:00:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:00:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:00:53,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211033755] [2022-04-15 05:00:53,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211033755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:00:53,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:00:53,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:00:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562727695] [2022-04-15 05:00:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:00:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:00:53,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:00:53,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:53,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:00:53,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:00:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:00:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:00:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:00:53,954 INFO L87 Difference]: Start difference. First operand 3785 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:55,574 INFO L93 Difference]: Finished difference Result 6413 states and 8713 transitions. [2022-04-15 05:00:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:00:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:00:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:00:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 05:00:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 05:00:55,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 05:00:55,648 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-15 05:00:56,999 INFO L225 Difference]: With dead ends: 6413 [2022-04-15 05:00:56,999 INFO L226 Difference]: Without dead ends: 6411 [2022-04-15 05:00:57,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:00:57,001 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:00:57,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:00:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-15 05:00:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-15 05:00:57,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:00:57,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:57,130 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:57,138 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:00:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:58,477 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-15 05:00:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-15 05:00:58,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:58,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:58,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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 6411 states. [2022-04-15 05:00:58,496 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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 6411 states. [2022-04-15 05:00:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:00:59,854 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-15 05:00:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-15 05:00:59,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:00:59,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:00:59,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:00:59,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:00:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7303 transitions. [2022-04-15 05:01:00,929 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7303 transitions. Word has length 28 [2022-04-15 05:01:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:00,929 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7303 transitions. [2022-04-15 05:01:00,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7303 transitions. [2022-04-15 05:01:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:01:00,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:00,932 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:01:00,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 05:01:00,933 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1660978126, now seen corresponding path program 1 times [2022-04-15 05:01:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169704673] [2022-04-15 05:01:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:00,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124044#true} is VALID [2022-04-15 05:01:00,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {124044#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124044#true} {124044#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {124044#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:00,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {124050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124044#true} is VALID [2022-04-15 05:01:00,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {124044#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124044#true} {124044#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {124044#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {124044#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {124044#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {124044#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {124044#true} [217] L68-->L68-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[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {124044#true} [219] L68-2-->L72-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[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {124044#true} [221] L72-1-->L76-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[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {124044#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {124044#true} [225] L80-1-->L84-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[] {124044#true} is VALID [2022-04-15 05:01:00,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {124044#true} [227] L84-1-->L88-1: Formula: (= 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[] {124044#true} is VALID [2022-04-15 05:01:00,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {124044#true} [229] L88-1-->L92-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[] {124044#true} is VALID [2022-04-15 05:01:00,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {124044#true} [231] L92-1-->L96-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {124049#(= main_~p8~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {124049#(= main_~p8~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {124049#(= main_~p8~0 0)} [237] L104-1-->L110-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {124049#(= main_~p8~0 0)} [241] L110-1-->L115-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {124049#(= main_~p8~0 0)} [247] L115-1-->L120-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {124049#(= main_~p8~0 0)} [251] L120-1-->L125-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {124049#(= main_~p8~0 0)} [255] L125-1-->L130-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {124049#(= main_~p8~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {124049#(= main_~p8~0 0)} [263] L135-1-->L140-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[] {124049#(= main_~p8~0 0)} is VALID [2022-04-15 05:01:00,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {124049#(= main_~p8~0 0)} [266] L140-1-->L146: 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[] {124045#false} is VALID [2022-04-15 05:01:00,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {124045#false} [268] L146-->L156-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[] {124045#false} is VALID [2022-04-15 05:01:00,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {124045#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124045#false} is VALID [2022-04-15 05:01:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:01:00,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169704673] [2022-04-15 05:01:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169704673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:00,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:00,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907713091] [2022-04-15 05:01:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:01:00,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:00,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:00,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:00,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:00,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:00,998 INFO L87 Difference]: Start difference. First operand 5641 states and 7303 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:06,794 INFO L93 Difference]: Finished difference Result 12813 states and 16521 transitions. [2022-04-15 05:01:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 05:01:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 05:01:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 05:01:06,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 05:01:06,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:08,553 INFO L225 Difference]: With dead ends: 12813 [2022-04-15 05:01:08,553 INFO L226 Difference]: Without dead ends: 7307 [2022-04-15 05:01:08,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:01:08,562 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:08,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:01:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-15 05:01:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-15 05:01:08,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:08,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:08,723 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:08,734 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:10,401 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-15 05:01:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-15 05:01:10,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:10,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:10,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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 7307 states. [2022-04-15 05:01:10,423 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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 7307 states. [2022-04-15 05:01:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:12,127 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-15 05:01:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-15 05:01:12,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:12,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:12,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:12,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9223 transitions. [2022-04-15 05:01:13,724 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9223 transitions. Word has length 28 [2022-04-15 05:01:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:13,724 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9223 transitions. [2022-04-15 05:01:13,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9223 transitions. [2022-04-15 05:01:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:01:13,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:13,727 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:01:13,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 05:01:13,728 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:13,728 INFO L85 PathProgramCache]: Analyzing trace with hash 456305864, now seen corresponding path program 1 times [2022-04-15 05:01:13,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:13,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224081422] [2022-04-15 05:01:13,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:13,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:13,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {159442#true} is VALID [2022-04-15 05:01:13,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {159442#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159442#true} {159442#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {159442#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:13,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {159448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {159442#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159442#true} {159442#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {159442#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {159442#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {159442#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {159442#true} is VALID [2022-04-15 05:01:13,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {159442#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {159442#true} [217] L68-->L68-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[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {159442#true} [219] L68-2-->L72-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[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {159442#true} [221] L72-1-->L76-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[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {159442#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {159442#true} [225] L80-1-->L84-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[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {159442#true} [227] L84-1-->L88-1: Formula: (= 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[] {159442#true} is VALID [2022-04-15 05:01:13,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {159442#true} [229] L88-1-->L92-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[] {159442#true} is VALID [2022-04-15 05:01:13,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {159442#true} [230] L92-1-->L96-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] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {159447#(not (= main_~p8~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {159447#(not (= main_~p8~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {159447#(not (= main_~p8~0 0))} [237] L104-1-->L110-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {159447#(not (= main_~p8~0 0))} [241] L110-1-->L115-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {159447#(not (= main_~p8~0 0))} [247] L115-1-->L120-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {159447#(not (= main_~p8~0 0))} [251] L120-1-->L125-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {159447#(not (= main_~p8~0 0))} [255] L125-1-->L130-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {159447#(not (= main_~p8~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {159447#(not (= main_~p8~0 0))} [263] L135-1-->L140-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[] {159447#(not (= main_~p8~0 0))} is VALID [2022-04-15 05:01:13,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {159447#(not (= main_~p8~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-15 05:01:13,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {159443#false} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-15 05:01:13,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {159443#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-15 05:01:13,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {159443#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159443#false} is VALID [2022-04-15 05:01:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:01:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:13,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224081422] [2022-04-15 05:01:13,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224081422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:13,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:13,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435133099] [2022-04-15 05:01:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:13,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:01:13,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:13,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:13,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:13,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:13,798 INFO L87 Difference]: Start difference. First operand 7305 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:17,566 INFO L93 Difference]: Finished difference Result 10957 states and 13769 transitions. [2022-04-15 05:01:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:01:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 05:01:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-15 05:01:17,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-15 05:01:17,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:19,314 INFO L225 Difference]: With dead ends: 10957 [2022-04-15 05:01:19,314 INFO L226 Difference]: Without dead ends: 7435 [2022-04-15 05:01:19,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:01:19,319 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:19,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:01:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-15 05:01:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-15 05:01:19,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:19,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:19,475 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:19,486 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:21,083 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-15 05:01:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-15 05:01:21,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:21,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:21,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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 7435 states. [2022-04-15 05:01:21,101 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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 7435 states. [2022-04-15 05:01:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:22,815 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-15 05:01:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-15 05:01:22,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:22,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:22,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:22,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9223 transitions. [2022-04-15 05:01:24,622 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9223 transitions. Word has length 29 [2022-04-15 05:01:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:24,622 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9223 transitions. [2022-04-15 05:01:24,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9223 transitions. [2022-04-15 05:01:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:01:24,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:24,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:01:24,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 05:01:24,626 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -49252761, now seen corresponding path program 1 times [2022-04-15 05:01:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:24,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909625739] [2022-04-15 05:01:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:24,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193368#true} is VALID [2022-04-15 05:01:24,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {193368#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193368#true} {193368#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {193368#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:24,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {193374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193368#true} is VALID [2022-04-15 05:01:24,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {193368#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193368#true} {193368#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {193368#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {193368#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {193368#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {193368#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {193368#true} [217] L68-->L68-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[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {193368#true} [219] L68-2-->L72-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[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {193368#true} [221] L72-1-->L76-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[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {193368#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {193368#true} [225] L80-1-->L84-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[] {193368#true} is VALID [2022-04-15 05:01:24,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {193368#true} [227] L84-1-->L88-1: Formula: (= 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[] {193368#true} is VALID [2022-04-15 05:01:24,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {193368#true} [229] L88-1-->L92-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[] {193368#true} is VALID [2022-04-15 05:01:24,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {193368#true} [231] L92-1-->L96-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[] {193368#true} is VALID [2022-04-15 05:01:24,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {193368#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {193373#(= main_~lk9~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {193373#(= main_~lk9~0 1)} [237] L104-1-->L110-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {193373#(= main_~lk9~0 1)} [241] L110-1-->L115-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {193373#(= main_~lk9~0 1)} [247] L115-1-->L120-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {193373#(= main_~lk9~0 1)} [251] L120-1-->L125-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {193373#(= main_~lk9~0 1)} [255] L125-1-->L130-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {193373#(= main_~lk9~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {193373#(= main_~lk9~0 1)} [263] L135-1-->L140-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[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {193373#(= main_~lk9~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {193373#(= main_~lk9~0 1)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {193373#(= main_~lk9~0 1)} is VALID [2022-04-15 05:01:24,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {193373#(= main_~lk9~0 1)} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {193369#false} is VALID [2022-04-15 05:01:24,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {193369#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193369#false} is VALID [2022-04-15 05:01:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:01:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909625739] [2022-04-15 05:01:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909625739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:24,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:24,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741488333] [2022-04-15 05:01:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:01:24,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:24,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:24,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:24,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:24,705 INFO L87 Difference]: Start difference. First operand 7433 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:29,535 INFO L93 Difference]: Finished difference Result 12301 states and 15369 transitions. [2022-04-15 05:01:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:01:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:01:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:01:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:01:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:01:29,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 05:01:29,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:33,636 INFO L225 Difference]: With dead ends: 12301 [2022-04-15 05:01:33,637 INFO L226 Difference]: Without dead ends: 12299 [2022-04-15 05:01:33,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:01:33,639 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:01:33,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:01:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-15 05:01:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-15 05:01:33,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:01:33,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:33,857 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:33,872 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:38,666 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-15 05:01:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-15 05:01:38,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:38,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:38,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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 12299 states. [2022-04-15 05:01:38,701 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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 12299 states. [2022-04-15 05:01:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:01:43,606 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-15 05:01:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-15 05:01:43,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:01:43,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:01:43,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:01:43,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:01:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13575 transitions. [2022-04-15 05:01:47,518 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13575 transitions. Word has length 29 [2022-04-15 05:01:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:01:47,518 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13575 transitions. [2022-04-15 05:01:47,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13575 transitions. [2022-04-15 05:01:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:01:47,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:01:47,528 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:01:47,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 05:01:47,529 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:01:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:01:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash -342655768, now seen corresponding path program 1 times [2022-04-15 05:01:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:01:47,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577410608] [2022-04-15 05:01:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:01:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:01:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:01:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:01:47,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {242334#true} is VALID [2022-04-15 05:01:47,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {242334#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242334#true} {242334#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {242334#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {242340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {242334#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242334#true} {242334#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {242334#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {242334#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {242334#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {242334#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {242334#true} is VALID [2022-04-15 05:01:47,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {242334#true} [217] L68-->L68-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {242334#true} [219] L68-2-->L72-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {242334#true} [221] L72-1-->L76-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {242334#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {242334#true} [225] L80-1-->L84-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {242334#true} [227] L84-1-->L88-1: Formula: (= 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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {242334#true} [229] L88-1-->L92-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {242334#true} [231] L92-1-->L96-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[] {242334#true} is VALID [2022-04-15 05:01:47,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {242334#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {242339#(= main_~p9~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {242339#(= main_~p9~0 0)} [237] L104-1-->L110-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {242339#(= main_~p9~0 0)} [241] L110-1-->L115-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {242339#(= main_~p9~0 0)} [247] L115-1-->L120-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {242339#(= main_~p9~0 0)} [251] L120-1-->L125-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {242339#(= main_~p9~0 0)} [255] L125-1-->L130-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {242339#(= main_~p9~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {242339#(= main_~p9~0 0)} [263] L135-1-->L140-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[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {242339#(= main_~p9~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {242339#(= main_~p9~0 0)} is VALID [2022-04-15 05:01:47,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {242339#(= main_~p9~0 0)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-15 05:01:47,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {242335#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-15 05:01:47,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {242335#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242335#false} is VALID [2022-04-15 05:01:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:01:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:01:47,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577410608] [2022-04-15 05:01:47,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577410608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:01:47,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:01:47,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:01:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84562380] [2022-04-15 05:01:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:01:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:01:47,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:01:47,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:01:47,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:01:47,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:01:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:01:47,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:01:47,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:01:47,585 INFO L87 Difference]: Start difference. First operand 11273 states and 13575 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:15,647 INFO L93 Difference]: Finished difference Result 25357 states and 30217 transitions. [2022-04-15 05:02:15,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-15 05:02:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 05:02:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-15 05:02:15,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-15 05:02:15,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:21,587 INFO L225 Difference]: With dead ends: 25357 [2022-04-15 05:02:21,587 INFO L226 Difference]: Without dead ends: 14347 [2022-04-15 05:02:21,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:21,596 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:21,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-15 05:02:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-15 05:02:21,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:21,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:21,878 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:21,896 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:28,111 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-15 05:02:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-15 05:02:28,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:28,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:28,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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 14347 states. [2022-04-15 05:02:28,147 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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 14347 states. [2022-04-15 05:02:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:34,424 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-15 05:02:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-15 05:02:34,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:34,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:34,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:34,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 16647 transitions. [2022-04-15 05:02:40,887 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 16647 transitions. Word has length 29 [2022-04-15 05:02:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:40,887 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 16647 transitions. [2022-04-15 05:02:40,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 16647 transitions. [2022-04-15 05:02:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:02:40,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:40,894 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:40,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 05:02:40,894 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1526802582, now seen corresponding path program 1 times [2022-04-15 05:02:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054986308] [2022-04-15 05:02:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {312036#true} is VALID [2022-04-15 05:02:40,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {312036#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {312036#true} {312036#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {312036#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {312042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {312036#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {312036#true} {312036#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {312036#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {312036#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {312036#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {312036#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {312036#true} is VALID [2022-04-15 05:02:40,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {312036#true} [217] L68-->L68-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {312036#true} [219] L68-2-->L72-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {312036#true} [221] L72-1-->L76-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {312036#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {312036#true} [225] L80-1-->L84-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {312036#true} [227] L84-1-->L88-1: Formula: (= 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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {312036#true} [229] L88-1-->L92-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {312036#true} [231] L92-1-->L96-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[] {312036#true} is VALID [2022-04-15 05:02:40,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {312036#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {312041#(not (= main_~p9~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {312041#(not (= main_~p9~0 0))} [237] L104-1-->L110-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {312041#(not (= main_~p9~0 0))} [241] L110-1-->L115-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {312041#(not (= main_~p9~0 0))} [247] L115-1-->L120-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {312041#(not (= main_~p9~0 0))} [251] L120-1-->L125-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {312041#(not (= main_~p9~0 0))} [255] L125-1-->L130-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {312041#(not (= main_~p9~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {312041#(not (= main_~p9~0 0))} [263] L135-1-->L140-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[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {312041#(not (= main_~p9~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {312041#(not (= main_~p9~0 0))} is VALID [2022-04-15 05:02:40,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {312041#(not (= main_~p9~0 0))} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-15 05:02:40,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {312037#false} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-15 05:02:40,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {312037#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-15 05:02:40,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {312037#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312037#false} is VALID [2022-04-15 05:02:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054986308] [2022-04-15 05:02:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054986308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:40,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:40,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:40,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378731360] [2022-04-15 05:02:40,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:02:40,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:40,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:41,003 INFO L87 Difference]: Start difference. First operand 14345 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:56,459 INFO L93 Difference]: Finished difference Result 21517 states and 24841 transitions. [2022-04-15 05:02:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:02:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 05:02:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 05:02:56,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 05:02:56,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:03:02,230 INFO L225 Difference]: With dead ends: 21517 [2022-04-15 05:03:02,231 INFO L226 Difference]: Without dead ends: 14603 [2022-04-15 05:03:02,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:03:02,238 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:03:02,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:03:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-15 05:03:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-15 05:03:02,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:03:02,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:02,496 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:02,512 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:09,505 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-15 05:03:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-15 05:03:09,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:09,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:09,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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 14603 states. [2022-04-15 05:03:09,548 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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 14603 states. [2022-04-15 05:03:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:16,957 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-15 05:03:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-15 05:03:17,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:17,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:17,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:03:17,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:03:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16647 transitions. [2022-04-15 05:03:24,777 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16647 transitions. Word has length 30 [2022-04-15 05:03:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:03:24,778 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16647 transitions. [2022-04-15 05:03:24,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16647 transitions. [2022-04-15 05:03:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:03:24,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:03:24,785 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:03:24,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 05:03:24,785 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:03:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:03:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2032361207, now seen corresponding path program 1 times [2022-04-15 05:03:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:03:24,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016891932] [2022-04-15 05:03:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:03:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:03:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:03:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:03:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:03:24,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {378666#true} is VALID [2022-04-15 05:03:24,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {378666#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378666#true} {378666#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {378666#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:03:24,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {378672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {378666#true} is VALID [2022-04-15 05:03:24,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {378666#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378666#true} {378666#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {378666#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {378666#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {378666#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {378666#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {378666#true} [217] L68-->L68-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[] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {378666#true} [219] L68-2-->L72-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[] {378666#true} is VALID [2022-04-15 05:03:24,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {378666#true} [221] L72-1-->L76-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[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {378666#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {378666#true} [225] L80-1-->L84-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[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {378666#true} [227] L84-1-->L88-1: Formula: (= 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[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {378666#true} [229] L88-1-->L92-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[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {378666#true} [231] L92-1-->L96-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[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {378666#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {378666#true} is VALID [2022-04-15 05:03:24,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {378666#true} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {378671#(= main_~lk10~0 1)} [237] L104-1-->L110-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {378671#(= main_~lk10~0 1)} [241] L110-1-->L115-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {378671#(= main_~lk10~0 1)} [247] L115-1-->L120-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {378671#(= main_~lk10~0 1)} [251] L120-1-->L125-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {378671#(= main_~lk10~0 1)} [255] L125-1-->L130-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {378671#(= main_~lk10~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {378671#(= main_~lk10~0 1)} [263] L135-1-->L140-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[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {378671#(= main_~lk10~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {378671#(= main_~lk10~0 1)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {378671#(= main_~lk10~0 1)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {378671#(= main_~lk10~0 1)} is VALID [2022-04-15 05:03:24,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {378671#(= main_~lk10~0 1)} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {378667#false} is VALID [2022-04-15 05:03:24,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {378667#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378667#false} is VALID [2022-04-15 05:03:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:03:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:03:24,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016891932] [2022-04-15 05:03:24,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016891932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:03:24,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:03:24,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:03:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360677509] [2022-04-15 05:03:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:03:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:03:24,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:03:24,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:24,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:03:24,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:03:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:03:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:03:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:03:24,867 INFO L87 Difference]: Start difference. First operand 14601 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:46,418 INFO L93 Difference]: Finished difference Result 23563 states and 26632 transitions. [2022-04-15 05:03:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:03:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:03:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:03:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 05:03:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 05:03:46,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 05:03:46,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:04:02,085 INFO L225 Difference]: With dead ends: 23563 [2022-04-15 05:04:02,085 INFO L226 Difference]: Without dead ends: 23561 [2022-04-15 05:04:02,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:04:02,088 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:04:02,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:04:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23561 states. [2022-04-15 05:04:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23561 to 22537. [2022-04-15 05:04:02,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:04:02,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:04:02,493 INFO L74 IsIncluded]: Start isIncluded. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:04:02,524 INFO L87 Difference]: Start difference. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:04:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:04:18,292 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-15 05:04:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-15 05:04:18,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:04:18,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:04:18,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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 23561 states. [2022-04-15 05:04:18,351 INFO L87 Difference]: Start difference. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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 23561 states. [2022-04-15 05:04:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:04:45,340 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-15 05:04:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-15 05:04:45,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:04:45,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:04:45,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:04:45,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:04:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:05:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 25095 transitions. [2022-04-15 05:05:00,861 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 25095 transitions. Word has length 30 [2022-04-15 05:05:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:05:00,862 INFO L478 AbstractCegarLoop]: Abstraction has 22537 states and 25095 transitions. [2022-04-15 05:05:00,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:05:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 25095 transitions. [2022-04-15 05:05:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:05:00,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:05:00,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:05:00,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 05:05:00,880 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:05:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:05:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1969203082, now seen corresponding path program 1 times [2022-04-15 05:05:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:05:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593654830] [2022-04-15 05:05:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:05:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:05:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:05:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:05:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:05:00,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {473449#true} is VALID [2022-04-15 05:05:00,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {473449#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {473449#true} {473449#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {473449#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:05:00,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {473455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {473449#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {473449#true} {473449#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {473449#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {473449#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |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_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_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)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_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_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, 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_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {473449#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {473449#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~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_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~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_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {473449#true} [217] L68-->L68-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[] {473449#true} is VALID [2022-04-15 05:05:00,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {473449#true} [219] L68-2-->L72-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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {473449#true} [221] L72-1-->L76-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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {473449#true} [223] L76-1-->L80-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {473449#true} [225] L80-1-->L84-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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {473449#true} [227] L84-1-->L88-1: Formula: (= 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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {473449#true} [229] L88-1-->L92-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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {473449#true} [231] L92-1-->L96-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[] {473449#true} is VALID [2022-04-15 05:05:00,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {473449#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {473449#true} is VALID [2022-04-15 05:05:00,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {473449#true} [235] L100-1-->L104-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {473454#(= main_~p10~0 0)} [237] L104-1-->L110-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {473454#(= main_~p10~0 0)} [241] L110-1-->L115-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {473454#(= main_~p10~0 0)} [247] L115-1-->L120-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {473454#(= main_~p10~0 0)} [251] L120-1-->L125-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {473454#(= main_~p10~0 0)} [255] L125-1-->L130-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {473454#(= main_~p10~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {473454#(= main_~p10~0 0)} [263] L135-1-->L140-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[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {473454#(= main_~p10~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {473454#(= main_~p10~0 0)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {473454#(= main_~p10~0 0)} is VALID [2022-04-15 05:05:00,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {473454#(= main_~p10~0 0)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-15 05:05:00,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {473450#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-15 05:05:00,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {473450#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473450#false} is VALID [2022-04-15 05:05:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:05:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:05:00,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593654830] [2022-04-15 05:05:00,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593654830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:05:00,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:05:00,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:05:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143517670] [2022-04-15 05:05:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:05:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:05:00,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:05:00,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:05:00,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:05:00,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:05:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:05:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:05:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:05:00,942 INFO L87 Difference]: Start difference. First operand 22537 states and 25095 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:07:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:07:51,071 INFO L93 Difference]: Finished difference Result 50185 states and 54791 transitions. [2022-04-15 05:07:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:07:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-15 05:07:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:07:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:07:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 05:07:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:07:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 05:07:51,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 05:07:51,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:07:51,180 INFO L225 Difference]: With dead ends: 50185 [2022-04-15 05:07:51,180 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:07:51,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:07:51,218 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:07:51,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:07:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:07:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:07:51,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:07:51,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:07:51,219 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:07:51,219 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:07:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:07:51,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:07:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:07:51,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:07:51,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:07:51,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:07:51,220 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:07:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:07:51,220 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:07:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:07:51,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:07:51,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:07:51,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:07:51,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:07:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:07:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:07:51,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-15 05:07:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:07:51,221 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:07:51,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:07:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:07:51,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:07:51,224 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:07:51,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 05:07:51,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:10:57,412 WARN L232 SmtUtils]: Spent 3.10m on a formula simplification that was a NOOP. DAG size: 4152 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 05:10:57,470 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 05:10:57,470 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:10:57,470 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:10:57,470 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:10:57,470 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:10:57,470 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:10:57,470 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:10:57,470 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 165) the Hoare annotation is: true [2022-04-15 05:10:57,471 INFO L885 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2022-04-15 05:10:57,471 INFO L885 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 165) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 165) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,471 INFO L882 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L878 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,472 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-04-15 05:10:57,473 INFO L882 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,474 INFO L882 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-04-15 05:10:57,474 INFO L882 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2022-04-15 05:10:57,474 INFO L882 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2022-04-15 05:10:57,477 INFO L719 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, 1, 1, 1, 1, 1, 1] [2022-04-15 05:10:57,478 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 05:10:57,482 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-15 05:10:57,483 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-15 05:10:57,484 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-15 05:10:57,485 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-15 05:10:57,486 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-15 05:10:57,487 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-15 05:10:57,487 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-15 05:10:57,487 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-15 05:10:57,487 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:10:57,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:10:57 BasicIcfg [2022-04-15 05:10:57,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:10:57,494 INFO L158 Benchmark]: Toolchain (without parser) took 628030.05ms. Allocated memory was 183.5MB in the beginning and 659.6MB in the end (delta: 476.1MB). Free memory was 125.1MB in the beginning and 490.4MB in the end (delta: -365.3MB). Peak memory consumption was 444.5MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,494 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:10:57,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.23ms. Allocated memory was 183.5MB in the beginning and 263.2MB in the end (delta: 79.7MB). Free memory was 124.9MB in the beginning and 232.6MB in the end (delta: -107.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,494 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 263.2MB. Free memory was 232.6MB in the beginning and 231.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,495 INFO L158 Benchmark]: RCFGBuilder took 339.48ms. Allocated memory is still 263.2MB. Free memory was 230.6MB in the beginning and 216.3MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,495 INFO L158 Benchmark]: IcfgTransformer took 89.30ms. Allocated memory is still 263.2MB. Free memory was 216.3MB in the beginning and 214.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,495 INFO L158 Benchmark]: TraceAbstraction took 627313.77ms. Allocated memory was 263.2MB in the beginning and 659.6MB in the end (delta: 396.4MB). Free memory was 213.5MB in the beginning and 490.4MB in the end (delta: -276.9MB). Peak memory consumption was 453.7MB. Max. memory is 8.0GB. [2022-04-15 05:10:57,496 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.12ms. Allocated memory is still 183.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.23ms. Allocated memory was 183.5MB in the beginning and 263.2MB in the end (delta: 79.7MB). Free memory was 124.9MB in the beginning and 232.6MB in the end (delta: -107.7MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 263.2MB. Free memory was 232.6MB in the beginning and 231.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 339.48ms. Allocated memory is still 263.2MB. Free memory was 230.6MB in the beginning and 216.3MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 89.30ms. Allocated memory is still 263.2MB. Free memory was 216.3MB in the beginning and 214.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 627313.77ms. Allocated memory was 263.2MB in the beginning and 659.6MB in the end (delta: 396.4MB). Free memory was 213.5MB in the beginning and 490.4MB in the end (delta: -276.9MB). Peak memory consumption was 453.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 627.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 301.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 186.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 2693 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2488 mSDtfsCounter, 1747 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22537occurred in iteration=28, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 136.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 186.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:10:57,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...