/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:55:38,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:55:38,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:55:38,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:55:38,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:55:38,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:55:38,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:55:38,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:55:38,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:55:38,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:55:38,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:55:38,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:55:38,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:55:38,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:55:38,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:55:38,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:55:38,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:55:38,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:55:38,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:55:38,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:55:38,548 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:55:38,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:55:38,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:55:38,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:55:38,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:55:38,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:55:38,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:55:38,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:55:38,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:55:38,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:55:38,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:55:38,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:55:38,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:55:38,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:55:38,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:55:38,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:55:38,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:55:38,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:55:38,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:55:38,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:55:38,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:55:38,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:55:38,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:55:38,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:55:38,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:55:38,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:55:38,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:55:38,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:55:38,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:55:38,585 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:55:38,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:55:38,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:55:38,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:55:38,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:55:38,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:55:38,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:55:38,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:55:38,588 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:55:38,588 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-08 02:55:38,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:55:38,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:55:38,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:55:38,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:55:38,797 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:55:38,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-08 02:55:38,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a225499/6ff76ca44e434376a2d1fa08cf073c4e/FLAG5238d0b2d [2022-04-08 02:55:39,227 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:55:39,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-08 02:55:39,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a225499/6ff76ca44e434376a2d1fa08cf073c4e/FLAG5238d0b2d [2022-04-08 02:55:39,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a225499/6ff76ca44e434376a2d1fa08cf073c4e [2022-04-08 02:55:39,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:55:39,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:55:39,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:55:39,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:55:39,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:55:39,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b956ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39, skipping insertion in model container [2022-04-08 02:55:39,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:55:39,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:55:39,460 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_12.c[4591,4604] [2022-04-08 02:55:39,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:55:39,468 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:55:39,492 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_12.c[4591,4604] [2022-04-08 02:55:39,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:55:39,503 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:55:39,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39 WrapperNode [2022-04-08 02:55:39,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:55:39,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:55:39,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:55:39,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:55:39,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:55:39,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:55:39,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:55:39,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:55:39,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:55:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:55:39,567 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-08 02:55:39,585 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-08 02:55:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:55:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:55:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:55:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:55:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:55:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:55:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:55:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:55:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:55:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:55:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:55:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:55:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:55:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:55:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:55:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:55:39,657 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:55:39,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:55:39,841 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:55:39,846 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:55:39,846 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:55:39,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:55:39 BoogieIcfgContainer [2022-04-08 02:55:39,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:55:39,848 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:55:39,848 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:55:39,849 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:55:39,854 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:55:39" (1/1) ... [2022-04-08 02:55:39,859 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:55:39,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:55:39 BasicIcfg [2022-04-08 02:55:39,920 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:55:39,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:55:39,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:55:39,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:55:39,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:55:39" (1/4) ... [2022-04-08 02:55:39,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0ea22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:55:39, skipping insertion in model container [2022-04-08 02:55:39,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:39" (2/4) ... [2022-04-08 02:55:39,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0ea22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:55:39, skipping insertion in model container [2022-04-08 02:55:39,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:55:39" (3/4) ... [2022-04-08 02:55:39,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0ea22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:55:39, skipping insertion in model container [2022-04-08 02:55:39,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:55:39" (4/4) ... [2022-04-08 02:55:39,931 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.cqvasr [2022-04-08 02:55:39,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:55:39,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:55:39,963 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:55:39,967 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-08 02:55:39,967 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:55:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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-08 02:55:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 02:55:39,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:39,993 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-08 02:55:39,994 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1823990193, now seen corresponding path program 1 times [2022-04-08 02:55:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804655493] [2022-04-08 02:55:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:40,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {54#true} is VALID [2022-04-08 02:55:40,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:55:40,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:55:40,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:40,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {54#true} is VALID [2022-04-08 02:55:40,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:55:40,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:55:40,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:55:40,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {54#true} is VALID [2022-04-08 02:55:40,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {54#true} is VALID [2022-04-08 02:55:40,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {54#true} is VALID [2022-04-08 02:55:40,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} [250] L78-->L78-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} [252] L78-2-->L82-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} [254] L82-1-->L86-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} [258] L90-1-->L94-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} [260] L94-1-->L98-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} [262] L98-1-->L102-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} [264] L102-1-->L106-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} [266] L106-1-->L110-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} [268] L110-1-->L114-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] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} [274] L122-1-->L129: 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[] {59#(= main_~lk1~0 1)} is VALID [2022-04-08 02:55:40,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} [276] L129-->L184-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[] {55#false} is VALID [2022-04-08 02:55:40,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-08 02:55:40,281 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-08 02:55:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:40,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804655493] [2022-04-08 02:55:40,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804655493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:40,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:40,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587461734] [2022-04-08 02:55:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:40,289 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-08 02:55:40,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:40,293 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-08 02:55:40,320 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-08 02:55:40,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:40,341 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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 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-08 02:55:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:40,660 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-08 02:55:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:40,661 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-08 02:55:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:40,663 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-08 02:55:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 02:55:40,674 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-08 02:55:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 02:55:40,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 02:55:40,814 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-08 02:55:40,821 INFO L225 Difference]: With dead ends: 100 [2022-04-08 02:55:40,821 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 02:55:40,823 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-08 02:55:40,826 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:40,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:55:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 02:55:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-08 02:55:40,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:40,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:40,856 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:40,858 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:40,865 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-08 02:55:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-08 02:55:40,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:40,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:40,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 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 85 states. [2022-04-08 02:55:40,868 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 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 85 states. [2022-04-08 02:55:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:40,873 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-08 02:55:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-08 02:55:40,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:40,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:40,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:40,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-08 02:55:40,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-08 02:55:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:40,877 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-08 02:55:40,877 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-08 02:55:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-08 02:55:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 02:55:40,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:40,878 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-08 02:55:40,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:55:40,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash -316438384, now seen corresponding path program 1 times [2022-04-08 02:55:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:40,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607860513] [2022-04-08 02:55:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:40,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {413#true} is VALID [2022-04-08 02:55:40,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-08 02:55:40,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-08 02:55:40,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:40,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {413#true} is VALID [2022-04-08 02:55:40,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-08 02:55:40,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-08 02:55:40,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-08 02:55:40,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {413#true} is VALID [2022-04-08 02:55:40,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {413#true} is VALID [2022-04-08 02:55:40,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {413#true} is VALID [2022-04-08 02:55:40,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#true} [251] L78-->L78-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[] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= main_~p1~0 0)} [252] L78-2-->L82-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(= main_~p1~0 0)} [254] L82-1-->L86-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#(= main_~p1~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#(= main_~p1~0 0)} [258] L90-1-->L94-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#(= main_~p1~0 0)} [260] L94-1-->L98-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(= main_~p1~0 0)} [262] L98-1-->L102-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#(= main_~p1~0 0)} [264] L102-1-->L106-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#(= main_~p1~0 0)} [266] L106-1-->L110-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(= main_~p1~0 0)} [268] L110-1-->L114-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] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(= main_~p1~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(= main_~p1~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {418#(= main_~p1~0 0)} is VALID [2022-04-08 02:55:40,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {418#(= main_~p1~0 0)} [274] L122-1-->L129: 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[] {414#false} is VALID [2022-04-08 02:55:40,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {414#false} [276] L129-->L184-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[] {414#false} is VALID [2022-04-08 02:55:40,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {414#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-08 02:55:40,944 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-08 02:55:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:40,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607860513] [2022-04-08 02:55:40,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607860513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:40,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:40,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581618495] [2022-04-08 02:55:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:40,946 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-08 02:55:40,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:40,946 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-08 02:55:40,961 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-08 02:55:40,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:40,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:40,962 INFO L87 Difference]: Start difference. First operand 59 states and 106 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-08 02:55:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,153 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-08 02:55:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:41,154 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-08 02:55:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:41,154 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-08 02:55:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 02:55:41,156 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-08 02:55:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-08 02:55:41,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-08 02:55:41,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:41,339 INFO L225 Difference]: With dead ends: 138 [2022-04-08 02:55:41,339 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 02:55:41,342 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-08 02:55:41,345 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:41,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:55:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 02:55:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-08 02:55:41,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:41,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,354 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,354 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,357 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-08 02:55:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-08 02:55:41,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:41,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:41,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 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 85 states. [2022-04-08 02:55:41,358 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 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 85 states. [2022-04-08 02:55:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,360 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-08 02:55:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-08 02:55:41,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:41,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:41,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:41,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-08 02:55:41,363 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-08 02:55:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:41,364 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-08 02:55:41,364 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-08 02:55:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-08 02:55:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:55:41,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:41,364 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-08 02:55:41,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:55:41,365 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -709089080, now seen corresponding path program 1 times [2022-04-08 02:55:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:41,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384711593] [2022-04-08 02:55:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:41,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {833#true} is VALID [2022-04-08 02:55:41,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-08 02:55:41,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-08 02:55:41,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:41,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {833#true} is VALID [2022-04-08 02:55:41,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-08 02:55:41,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-08 02:55:41,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#true} is VALID [2022-04-08 02:55:41,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {833#true} is VALID [2022-04-08 02:55:41,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {833#true} is VALID [2022-04-08 02:55:41,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {833#true} is VALID [2022-04-08 02:55:41,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} [250] L78-->L78-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= main_~p1~0 0))} [252] L78-2-->L82-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(not (= main_~p1~0 0))} [254] L82-1-->L86-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#(not (= main_~p1~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(not (= main_~p1~0 0))} [258] L90-1-->L94-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(not (= main_~p1~0 0))} [260] L94-1-->L98-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(not (= main_~p1~0 0))} [262] L98-1-->L102-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(not (= main_~p1~0 0))} [264] L102-1-->L106-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#(not (= main_~p1~0 0))} [266] L106-1-->L110-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#(not (= main_~p1~0 0))} [268] L110-1-->L114-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] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {838#(not (= main_~p1~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#(not (= main_~p1~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {838#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:55:41,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#(not (= main_~p1~0 0))} [275] L122-1-->L128-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[] {834#false} is VALID [2022-04-08 02:55:41,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {834#false} [278] L128-1-->L134: 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[] {834#false} is VALID [2022-04-08 02:55:41,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {834#false} [282] L134-->L184-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[] {834#false} is VALID [2022-04-08 02:55:41,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {834#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#false} is VALID [2022-04-08 02:55:41,422 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-08 02:55:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:41,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384711593] [2022-04-08 02:55:41,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384711593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:41,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:41,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144613007] [2022-04-08 02:55:41,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:41,423 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-08 02:55:41,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:41,423 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-08 02:55:41,436 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-08 02:55:41,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:41,437 INFO L87 Difference]: Start difference. First operand 83 states and 150 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-08 02:55:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,612 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-08 02:55:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:41,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-08 02:55:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:41,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-08 02:55:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 02:55:41,615 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-08 02:55:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-08 02:55:41,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-08 02:55:41,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:41,780 INFO L225 Difference]: With dead ends: 127 [2022-04-08 02:55:41,780 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 02:55:41,780 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-08 02:55:41,781 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:41,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 02:55:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-08 02:55:41,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:41,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,786 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,787 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,796 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 02:55:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-08 02:55:41,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:41,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:41,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 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 88 states. [2022-04-08 02:55:41,798 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 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 88 states. [2022-04-08 02:55:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:41,800 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 02:55:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-08 02:55:41,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:41,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:41,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:41,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-08 02:55:41,804 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-08 02:55:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:41,805 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-08 02:55:41,805 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-08 02:55:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-08 02:55:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:55:41,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:41,808 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-08 02:55:41,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:55:41,809 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1219623257, now seen corresponding path program 1 times [2022-04-08 02:55:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416080677] [2022-04-08 02:55:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:41,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {1253#true} is VALID [2022-04-08 02:55:41,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-08 02:55:41,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1253#true} {1253#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-08 02:55:41,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1253#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:41,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {1253#true} is VALID [2022-04-08 02:55:41,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {1253#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-08 02:55:41,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1253#true} {1253#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-08 02:55:41,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1253#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#true} is VALID [2022-04-08 02:55:41,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1253#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1253#true} is VALID [2022-04-08 02:55:41,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1253#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1253#true} is VALID [2022-04-08 02:55:41,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {1253#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1253#true} is VALID [2022-04-08 02:55:41,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1253#true} [251] L78-->L78-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[] {1253#true} is VALID [2022-04-08 02:55:41,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1253#true} [252] L78-2-->L82-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {1258#(= main_~lk2~0 1)} [254] L82-1-->L86-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#(= main_~lk2~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(= main_~lk2~0 1)} [258] L90-1-->L94-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#(= main_~lk2~0 1)} [260] L94-1-->L98-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(= main_~lk2~0 1)} [262] L98-1-->L102-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(= main_~lk2~0 1)} [264] L102-1-->L106-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {1258#(= main_~lk2~0 1)} [266] L106-1-->L110-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#(= main_~lk2~0 1)} [268] L110-1-->L114-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] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(= main_~lk2~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(= main_~lk2~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {1258#(= main_~lk2~0 1)} [275] L122-1-->L128-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[] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#(= main_~lk2~0 1)} [278] L128-1-->L134: 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[] {1258#(= main_~lk2~0 1)} is VALID [2022-04-08 02:55:41,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#(= main_~lk2~0 1)} [282] L134-->L184-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[] {1254#false} is VALID [2022-04-08 02:55:41,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#false} is VALID [2022-04-08 02:55:41,886 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-08 02:55:41,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:41,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416080677] [2022-04-08 02:55:41,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416080677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:41,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:41,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289263516] [2022-04-08 02:55:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:41,887 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-08 02:55:41,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:41,887 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-08 02:55:41,900 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-08 02:55:41,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:41,901 INFO L87 Difference]: Start difference. First operand 86 states and 152 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-08 02:55:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,054 INFO L93 Difference]: Finished difference Result 161 states and 289 transitions. [2022-04-08 02:55:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:42,054 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-08 02:55:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:42,054 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-08 02:55:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 02:55:42,056 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-08 02:55:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 02:55:42,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 02:55:42,154 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-08 02:55:42,157 INFO L225 Difference]: With dead ends: 161 [2022-04-08 02:55:42,157 INFO L226 Difference]: Without dead ends: 159 [2022-04-08 02:55:42,157 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-08 02:55:42,158 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:42,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-08 02:55:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2022-04-08 02:55:42,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:42,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,165 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,165 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,181 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-08 02:55:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-08 02:55:42,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:42,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:42,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 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 159 states. [2022-04-08 02:55:42,182 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 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 159 states. [2022-04-08 02:55:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,186 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-08 02:55:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-08 02:55:42,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:42,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:42,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:42,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 201 transitions. [2022-04-08 02:55:42,189 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 201 transitions. Word has length 24 [2022-04-08 02:55:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:42,189 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 201 transitions. [2022-04-08 02:55:42,190 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-08 02:55:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 201 transitions. [2022-04-08 02:55:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 02:55:42,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:42,190 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-08 02:55:42,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 02:55:42,190 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 287928552, now seen corresponding path program 1 times [2022-04-08 02:55:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:42,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787141085] [2022-04-08 02:55:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:42,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {1877#true} is VALID [2022-04-08 02:55:42,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1877#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-08 02:55:42,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1877#true} {1877#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-08 02:55:42,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1877#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:42,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {1877#true} is VALID [2022-04-08 02:55:42,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1877#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1877#true} {1877#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1877#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1877#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1877#true} is VALID [2022-04-08 02:55:42,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#true} [251] L78-->L78-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[] {1877#true} is VALID [2022-04-08 02:55:42,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#true} [253] L78-2-->L82-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[] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1882#(= main_~p2~0 0)} [254] L82-1-->L86-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1882#(= main_~p2~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {1882#(= main_~p2~0 0)} [258] L90-1-->L94-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {1882#(= main_~p2~0 0)} [260] L94-1-->L98-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {1882#(= main_~p2~0 0)} [262] L98-1-->L102-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1882#(= main_~p2~0 0)} [264] L102-1-->L106-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {1882#(= main_~p2~0 0)} [266] L106-1-->L110-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {1882#(= main_~p2~0 0)} [268] L110-1-->L114-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] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {1882#(= main_~p2~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {1882#(= main_~p2~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1882#(= main_~p2~0 0)} [275] L122-1-->L128-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[] {1882#(= main_~p2~0 0)} is VALID [2022-04-08 02:55:42,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {1882#(= main_~p2~0 0)} [278] L128-1-->L134: 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[] {1878#false} is VALID [2022-04-08 02:55:42,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {1878#false} [282] L134-->L184-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[] {1878#false} is VALID [2022-04-08 02:55:42,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {1878#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1878#false} is VALID [2022-04-08 02:55:42,262 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-08 02:55:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:42,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787141085] [2022-04-08 02:55:42,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787141085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:42,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:42,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795063417] [2022-04-08 02:55:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:42,263 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-08 02:55:42,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:42,263 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-08 02:55:42,275 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-08 02:55:42,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:42,276 INFO L87 Difference]: Start difference. First operand 113 states and 201 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-08 02:55:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,443 INFO L93 Difference]: Finished difference Result 265 states and 479 transitions. [2022-04-08 02:55:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:42,443 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-08 02:55:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:42,444 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-08 02:55:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-08 02:55:42,446 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-08 02:55:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2022-04-08 02:55:42,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 225 transitions. [2022-04-08 02:55:42,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:42,593 INFO L225 Difference]: With dead ends: 265 [2022-04-08 02:55:42,594 INFO L226 Difference]: Without dead ends: 161 [2022-04-08 02:55:42,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-08 02:55:42,599 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:42,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 113 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-08 02:55:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-08 02:55:42,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:42,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,612 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,612 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,615 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-08 02:55:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-08 02:55:42,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:42,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:42,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 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 161 states. [2022-04-08 02:55:42,616 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 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 161 states. [2022-04-08 02:55:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,619 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-08 02:55:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-08 02:55:42,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:42,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:42,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:42,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-08 02:55:42,623 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-08 02:55:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:42,623 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-08 02:55:42,623 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-08 02:55:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-08 02:55:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:55:42,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:42,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:55:42,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 02:55:42,624 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 846416876, now seen corresponding path program 1 times [2022-04-08 02:55:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104861880] [2022-04-08 02:55:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:42,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {2659#true} is VALID [2022-04-08 02:55:42,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {2659#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-08 02:55:42,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2659#true} {2659#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-08 02:55:42,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {2659#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:42,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {2659#true} is VALID [2022-04-08 02:55:42,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {2659#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-08 02:55:42,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2659#true} {2659#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-08 02:55:42,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {2659#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2659#true} is VALID [2022-04-08 02:55:42,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {2659#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2659#true} is VALID [2022-04-08 02:55:42,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {2659#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {2659#true} is VALID [2022-04-08 02:55:42,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {2659#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2659#true} is VALID [2022-04-08 02:55:42,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {2659#true} [251] L78-->L78-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[] {2659#true} is VALID [2022-04-08 02:55:42,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#true} [252] L78-2-->L82-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {2664#(not (= main_~p2~0 0))} [254] L82-1-->L86-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {2664#(not (= main_~p2~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {2664#(not (= main_~p2~0 0))} [258] L90-1-->L94-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2664#(not (= main_~p2~0 0))} [260] L94-1-->L98-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {2664#(not (= main_~p2~0 0))} [262] L98-1-->L102-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {2664#(not (= main_~p2~0 0))} [264] L102-1-->L106-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {2664#(not (= main_~p2~0 0))} [266] L106-1-->L110-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {2664#(not (= main_~p2~0 0))} [268] L110-1-->L114-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] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {2664#(not (= main_~p2~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {2664#(not (= main_~p2~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2664#(not (= main_~p2~0 0))} [275] L122-1-->L128-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[] {2664#(not (= main_~p2~0 0))} is VALID [2022-04-08 02:55:42,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {2664#(not (= main_~p2~0 0))} [279] L128-1-->L133-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[] {2660#false} is VALID [2022-04-08 02:55:42,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {2660#false} [284] L133-1-->L139: 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[] {2660#false} is VALID [2022-04-08 02:55:42,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {2660#false} [286] L139-->L184-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[] {2660#false} is VALID [2022-04-08 02:55:42,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {2660#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2660#false} is VALID [2022-04-08 02:55:42,666 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-08 02:55:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:42,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104861880] [2022-04-08 02:55:42,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104861880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:42,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:42,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153193137] [2022-04-08 02:55:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:42,667 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-08 02:55:42,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:42,668 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-08 02:55:42,679 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-08 02:55:42,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:42,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:42,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:42,681 INFO L87 Difference]: Start difference. First operand 159 states and 283 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-08 02:55:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:42,873 INFO L93 Difference]: Finished difference Result 238 states and 422 transitions. [2022-04-08 02:55:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:42,873 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-08 02:55:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:42,873 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-08 02:55:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-08 02:55:42,875 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-08 02:55:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2022-04-08 02:55:42,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 220 transitions. [2022-04-08 02:55:43,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:43,023 INFO L225 Difference]: With dead ends: 238 [2022-04-08 02:55:43,023 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 02:55:43,023 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-08 02:55:43,024 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:43,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 130 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:55:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 02:55:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-08 02:55:43,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:43,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,029 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,029 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,033 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-08 02:55:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-08 02:55:43,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 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 163 states. [2022-04-08 02:55:43,034 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 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 163 states. [2022-04-08 02:55:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,037 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-08 02:55:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-08 02:55:43,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:43,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 283 transitions. [2022-04-08 02:55:43,041 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 283 transitions. Word has length 25 [2022-04-08 02:55:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:43,041 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 283 transitions. [2022-04-08 02:55:43,041 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-08 02:55:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 283 transitions. [2022-04-08 02:55:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:55:43,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:43,041 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-08 02:55:43,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 02:55:43,042 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash 335882699, now seen corresponding path program 1 times [2022-04-08 02:55:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:43,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871898401] [2022-04-08 02:55:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {3420#true} is VALID [2022-04-08 02:55:43,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {3420#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-08 02:55:43,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3420#true} {3420#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-08 02:55:43,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {3420#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {3420#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3420#true} {3420#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {3420#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {3420#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {3420#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {3420#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {3420#true} [251] L78-->L78-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[] {3420#true} is VALID [2022-04-08 02:55:43,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {3420#true} [253] L78-2-->L82-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[] {3420#true} is VALID [2022-04-08 02:55:43,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {3420#true} [254] L82-1-->L86-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {3425#(= main_~lk3~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {3425#(= main_~lk3~0 1)} [258] L90-1-->L94-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {3425#(= main_~lk3~0 1)} [260] L94-1-->L98-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {3425#(= main_~lk3~0 1)} [262] L98-1-->L102-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {3425#(= main_~lk3~0 1)} [264] L102-1-->L106-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {3425#(= main_~lk3~0 1)} [266] L106-1-->L110-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {3425#(= main_~lk3~0 1)} [268] L110-1-->L114-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] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {3425#(= main_~lk3~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {3425#(= main_~lk3~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {3425#(= main_~lk3~0 1)} [275] L122-1-->L128-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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {3425#(= main_~lk3~0 1)} [279] L128-1-->L133-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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {3425#(= main_~lk3~0 1)} [284] L133-1-->L139: 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[] {3425#(= main_~lk3~0 1)} is VALID [2022-04-08 02:55:43,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {3425#(= main_~lk3~0 1)} [286] L139-->L184-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[] {3421#false} is VALID [2022-04-08 02:55:43,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3421#false} is VALID [2022-04-08 02:55:43,079 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-08 02:55:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871898401] [2022-04-08 02:55:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871898401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:43,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094832085] [2022-04-08 02:55:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:43,080 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-08 02:55:43,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:43,080 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-08 02:55:43,093 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-08 02:55:43,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:43,094 INFO L87 Difference]: Start difference. First operand 161 states and 283 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-08 02:55:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,260 INFO L93 Difference]: Finished difference Result 301 states and 537 transitions. [2022-04-08 02:55:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:43,260 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-08 02:55:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:43,260 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-08 02:55:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 02:55:43,262 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-08 02:55:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 02:55:43,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 02:55:43,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:43,364 INFO L225 Difference]: With dead ends: 301 [2022-04-08 02:55:43,364 INFO L226 Difference]: Without dead ends: 299 [2022-04-08 02:55:43,365 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-08 02:55:43,365 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:43,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-08 02:55:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2022-04-08 02:55:43,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:43,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,371 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,371 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,376 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-08 02:55:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-08 02:55:43,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 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 299 states. [2022-04-08 02:55:43,377 INFO L87 Difference]: Start difference. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 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 299 states. [2022-04-08 02:55:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,382 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-08 02:55:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-08 02:55:43,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:43,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 379 transitions. [2022-04-08 02:55:43,386 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 379 transitions. Word has length 25 [2022-04-08 02:55:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:43,386 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 379 transitions. [2022-04-08 02:55:43,386 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-08 02:55:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 379 transitions. [2022-04-08 02:55:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 02:55:43,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:43,387 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-08 02:55:43,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 02:55:43,387 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434508, now seen corresponding path program 1 times [2022-04-08 02:55:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242379248] [2022-04-08 02:55:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {4574#true} is VALID [2022-04-08 02:55:43,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {4574#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-08 02:55:43,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4574#true} {4574#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-08 02:55:43,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {4574#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {4580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {4574#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4574#true} {4574#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {4574#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {4574#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {4574#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {4574#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {4574#true} [251] L78-->L78-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[] {4574#true} is VALID [2022-04-08 02:55:43,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {4574#true} [253] L78-2-->L82-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[] {4574#true} is VALID [2022-04-08 02:55:43,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {4574#true} [255] L82-1-->L86-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {4579#(= main_~p3~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {4579#(= main_~p3~0 0)} [258] L90-1-->L94-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {4579#(= main_~p3~0 0)} [260] L94-1-->L98-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {4579#(= main_~p3~0 0)} [262] L98-1-->L102-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {4579#(= main_~p3~0 0)} [264] L102-1-->L106-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {4579#(= main_~p3~0 0)} [266] L106-1-->L110-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {4579#(= main_~p3~0 0)} [268] L110-1-->L114-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] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {4579#(= main_~p3~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {4579#(= main_~p3~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {4579#(= main_~p3~0 0)} [275] L122-1-->L128-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {4579#(= main_~p3~0 0)} [279] L128-1-->L133-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[] {4579#(= main_~p3~0 0)} is VALID [2022-04-08 02:55:43,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {4579#(= main_~p3~0 0)} [284] L133-1-->L139: 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[] {4575#false} is VALID [2022-04-08 02:55:43,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {4575#false} [286] L139-->L184-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[] {4575#false} is VALID [2022-04-08 02:55:43,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {4575#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4575#false} is VALID [2022-04-08 02:55:43,421 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-08 02:55:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:43,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242379248] [2022-04-08 02:55:43,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242379248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:43,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:43,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253986380] [2022-04-08 02:55:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:43,422 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-08 02:55:43,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:43,423 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-08 02:55:43,435 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-08 02:55:43,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:43,436 INFO L87 Difference]: Start difference. First operand 217 states and 379 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-08 02:55:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,603 INFO L93 Difference]: Finished difference Result 513 states and 905 transitions. [2022-04-08 02:55:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:43,603 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-08 02:55:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:43,604 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-08 02:55:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 02:55:43,605 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-08 02:55:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-08 02:55:43,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-08 02:55:43,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:43,736 INFO L225 Difference]: With dead ends: 513 [2022-04-08 02:55:43,736 INFO L226 Difference]: Without dead ends: 307 [2022-04-08 02:55:43,737 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-08 02:55:43,737 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:43,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-08 02:55:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-08 02:55:43,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:43,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,744 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,745 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,750 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-08 02:55:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-08 02:55:43,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 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 307 states. [2022-04-08 02:55:43,752 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 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 307 states. [2022-04-08 02:55:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:43,757 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-08 02:55:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-08 02:55:43,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:43,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:43,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:43,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 531 transitions. [2022-04-08 02:55:43,781 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 531 transitions. Word has length 25 [2022-04-08 02:55:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:43,781 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 531 transitions. [2022-04-08 02:55:43,781 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-08 02:55:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 531 transitions. [2022-04-08 02:55:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:55:43,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:43,782 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-08 02:55:43,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 02:55:43,782 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1822461380, now seen corresponding path program 1 times [2022-04-08 02:55:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:43,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121989141] [2022-04-08 02:55:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:43,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {6052#true} is VALID [2022-04-08 02:55:43,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {6052#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-08 02:55:43,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6052#true} {6052#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-08 02:55:43,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {6052#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:43,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {6058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {6052#true} is VALID [2022-04-08 02:55:43,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {6052#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-08 02:55:43,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6052#true} {6052#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-08 02:55:43,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {6052#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6052#true} is VALID [2022-04-08 02:55:43,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {6052#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6052#true} is VALID [2022-04-08 02:55:43,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {6052#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {6052#true} is VALID [2022-04-08 02:55:43,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {6052#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6052#true} is VALID [2022-04-08 02:55:43,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {6052#true} [251] L78-->L78-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[] {6052#true} is VALID [2022-04-08 02:55:43,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {6052#true} [253] L78-2-->L82-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[] {6052#true} is VALID [2022-04-08 02:55:43,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {6052#true} [254] L82-1-->L86-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {6057#(not (= main_~p3~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {6057#(not (= main_~p3~0 0))} [258] L90-1-->L94-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {6057#(not (= main_~p3~0 0))} [260] L94-1-->L98-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {6057#(not (= main_~p3~0 0))} [262] L98-1-->L102-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {6057#(not (= main_~p3~0 0))} [264] L102-1-->L106-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {6057#(not (= main_~p3~0 0))} [266] L106-1-->L110-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {6057#(not (= main_~p3~0 0))} [268] L110-1-->L114-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] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {6057#(not (= main_~p3~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {6057#(not (= main_~p3~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {6057#(not (= main_~p3~0 0))} [275] L122-1-->L128-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[] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {6057#(not (= main_~p3~0 0))} [279] L128-1-->L133-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[] {6057#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:55:43,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {6057#(not (= main_~p3~0 0))} [285] L133-1-->L138-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[] {6053#false} is VALID [2022-04-08 02:55:43,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {6053#false} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-08 02:55:43,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {6053#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-08 02:55:43,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {6053#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6053#false} is VALID [2022-04-08 02:55:43,830 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-08 02:55:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121989141] [2022-04-08 02:55:43,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121989141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:43,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:43,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019880480] [2022-04-08 02:55:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:43,831 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-08 02:55:43,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:43,831 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-08 02:55:43,845 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-08 02:55:43,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:43,845 INFO L87 Difference]: Start difference. First operand 305 states and 531 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-08 02:55:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,008 INFO L93 Difference]: Finished difference Result 457 states and 793 transitions. [2022-04-08 02:55:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:44,008 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-08 02:55:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:44,008 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-08 02:55:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 02:55:44,015 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-08 02:55:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-08 02:55:44,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-08 02:55:44,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:44,154 INFO L225 Difference]: With dead ends: 457 [2022-04-08 02:55:44,154 INFO L226 Difference]: Without dead ends: 311 [2022-04-08 02:55:44,154 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-08 02:55:44,156 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:44,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-08 02:55:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-08 02:55:44,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:44,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,163 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,164 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,169 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-08 02:55:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-08 02:55:44,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 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 311 states. [2022-04-08 02:55:44,171 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 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 311 states. [2022-04-08 02:55:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,177 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-08 02:55:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-08 02:55:44,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:44,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 531 transitions. [2022-04-08 02:55:44,183 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 531 transitions. Word has length 26 [2022-04-08 02:55:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:44,183 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 531 transitions. [2022-04-08 02:55:44,183 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-08 02:55:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 531 transitions. [2022-04-08 02:55:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:55:44,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:44,183 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-08 02:55:44,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 02:55:44,184 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1311927203, now seen corresponding path program 1 times [2022-04-08 02:55:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153213642] [2022-04-08 02:55:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:44,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {7486#true} is VALID [2022-04-08 02:55:44,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {7486#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-08 02:55:44,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7486#true} {7486#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {7486#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:44,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {7486#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7486#true} {7486#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {7486#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {7486#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {7486#true} is VALID [2022-04-08 02:55:44,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {7486#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {7486#true} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {7486#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {7486#true} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {7486#true} [251] L78-->L78-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[] {7486#true} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {7486#true} [253] L78-2-->L82-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[] {7486#true} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {7486#true} [255] L82-1-->L86-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[] {7486#true} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {7486#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {7491#(= main_~lk4~0 1)} [258] L90-1-->L94-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {7491#(= main_~lk4~0 1)} [260] L94-1-->L98-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {7491#(= main_~lk4~0 1)} [262] L98-1-->L102-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {7491#(= main_~lk4~0 1)} [264] L102-1-->L106-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {7491#(= main_~lk4~0 1)} [266] L106-1-->L110-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {7491#(= main_~lk4~0 1)} [268] L110-1-->L114-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] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {7491#(= main_~lk4~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {7491#(= main_~lk4~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {7491#(= main_~lk4~0 1)} [275] L122-1-->L128-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {7491#(= main_~lk4~0 1)} [279] L128-1-->L133-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {7491#(= main_~lk4~0 1)} [285] L133-1-->L138-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[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {7491#(= main_~lk4~0 1)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {7491#(= main_~lk4~0 1)} is VALID [2022-04-08 02:55:44,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {7491#(= main_~lk4~0 1)} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {7487#false} is VALID [2022-04-08 02:55:44,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {7487#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7487#false} is VALID [2022-04-08 02:55:44,217 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-08 02:55:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:44,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153213642] [2022-04-08 02:55:44,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153213642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:44,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:44,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57372174] [2022-04-08 02:55:44,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:44,218 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-08 02:55:44,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:44,218 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-08 02:55:44,232 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-08 02:55:44,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:44,232 INFO L87 Difference]: Start difference. First operand 309 states and 531 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-08 02:55:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,402 INFO L93 Difference]: Finished difference Result 573 states and 1001 transitions. [2022-04-08 02:55:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:44,403 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-08 02:55:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:44,403 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-08 02:55:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 02:55:44,404 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-08 02:55:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-08 02:55:44,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-08 02:55:44,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:44,497 INFO L225 Difference]: With dead ends: 573 [2022-04-08 02:55:44,497 INFO L226 Difference]: Without dead ends: 571 [2022-04-08 02:55:44,498 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-08 02:55:44,499 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:44,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-08 02:55:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-08 02:55:44,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:44,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,508 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,510 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,522 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-08 02:55:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-08 02:55:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 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 571 states. [2022-04-08 02:55:44,524 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 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 571 states. [2022-04-08 02:55:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,538 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-08 02:55:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-08 02:55:44,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:44,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 719 transitions. [2022-04-08 02:55:44,548 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 719 transitions. Word has length 26 [2022-04-08 02:55:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:44,548 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 719 transitions. [2022-04-08 02:55:44,548 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-08 02:55:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 719 transitions. [2022-04-08 02:55:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:55:44,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:44,549 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-08 02:55:44,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 02:55:44,550 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1475488284, now seen corresponding path program 1 times [2022-04-08 02:55:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054966254] [2022-04-08 02:55:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:44,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {9676#true} is VALID [2022-04-08 02:55:44,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {9676#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-08 02:55:44,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9676#true} {9676#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-08 02:55:44,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {9676#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:44,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {9682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {9676#true} is VALID [2022-04-08 02:55:44,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {9676#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-08 02:55:44,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9676#true} {9676#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-08 02:55:44,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {9676#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {9676#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {9676#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {9676#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {9676#true} [251] L78-->L78-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[] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {9676#true} [253] L78-2-->L82-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[] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {9676#true} [255] L82-1-->L86-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[] {9676#true} is VALID [2022-04-08 02:55:44,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {9676#true} [257] L86-1-->L90-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {9681#(= main_~p4~0 0)} [258] L90-1-->L94-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {9681#(= main_~p4~0 0)} [260] L94-1-->L98-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {9681#(= main_~p4~0 0)} [262] L98-1-->L102-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {9681#(= main_~p4~0 0)} [264] L102-1-->L106-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {9681#(= main_~p4~0 0)} [266] L106-1-->L110-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {9681#(= main_~p4~0 0)} [268] L110-1-->L114-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] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {9681#(= main_~p4~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {9681#(= main_~p4~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {9681#(= main_~p4~0 0)} [275] L122-1-->L128-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {9681#(= main_~p4~0 0)} [279] L128-1-->L133-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {9681#(= main_~p4~0 0)} [285] L133-1-->L138-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[] {9681#(= main_~p4~0 0)} is VALID [2022-04-08 02:55:44,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {9681#(= main_~p4~0 0)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-08 02:55:44,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {9677#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-08 02:55:44,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {9677#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9677#false} is VALID [2022-04-08 02:55:44,595 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-08 02:55:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054966254] [2022-04-08 02:55:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054966254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964608340] [2022-04-08 02:55:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:44,596 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-08 02:55:44,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:44,596 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-08 02:55:44,609 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-08 02:55:44,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:44,610 INFO L87 Difference]: Start difference. First operand 425 states and 719 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-08 02:55:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,809 INFO L93 Difference]: Finished difference Result 1005 states and 1713 transitions. [2022-04-08 02:55:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:44,809 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-08 02:55:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:44,809 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-08 02:55:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-08 02:55:44,811 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-08 02:55:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-08 02:55:44,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-08 02:55:44,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:44,951 INFO L225 Difference]: With dead ends: 1005 [2022-04-08 02:55:44,951 INFO L226 Difference]: Without dead ends: 595 [2022-04-08 02:55:44,952 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-08 02:55:44,953 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:44,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-08 02:55:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-08 02:55:44,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:44,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,964 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,965 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,977 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-08 02:55:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-08 02:55:44,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 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 595 states. [2022-04-08 02:55:44,980 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 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 595 states. [2022-04-08 02:55:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:44,993 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-08 02:55:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-08 02:55:44,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:44,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:44,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:44,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 999 transitions. [2022-04-08 02:55:45,008 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 999 transitions. Word has length 26 [2022-04-08 02:55:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:45,008 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 999 transitions. [2022-04-08 02:55:45,008 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-08 02:55:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 999 transitions. [2022-04-08 02:55:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:55:45,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:45,009 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-08 02:55:45,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 02:55:45,009 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2015070056, now seen corresponding path program 1 times [2022-04-08 02:55:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:45,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691035725] [2022-04-08 02:55:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:45,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {12530#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12530#true} {12530#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {12530#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:45,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {12536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {12530#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12530#true} {12530#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-08 02:55:45,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {12530#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {12530#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {12530#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {12530#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {12530#true} [251] L78-->L78-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[] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {12530#true} [253] L78-2-->L82-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[] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {12530#true} [255] L82-1-->L86-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[] {12530#true} is VALID [2022-04-08 02:55:45,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {12530#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {12535#(not (= main_~p4~0 0))} [258] L90-1-->L94-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {12535#(not (= main_~p4~0 0))} [260] L94-1-->L98-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {12535#(not (= main_~p4~0 0))} [262] L98-1-->L102-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {12535#(not (= main_~p4~0 0))} [264] L102-1-->L106-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {12535#(not (= main_~p4~0 0))} [266] L106-1-->L110-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {12535#(not (= main_~p4~0 0))} [268] L110-1-->L114-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] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {12535#(not (= main_~p4~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {12535#(not (= main_~p4~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {12535#(not (= main_~p4~0 0))} [275] L122-1-->L128-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {12535#(not (= main_~p4~0 0))} [279] L128-1-->L133-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {12535#(not (= main_~p4~0 0))} [285] L133-1-->L138-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[] {12535#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:55:45,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {12535#(not (= main_~p4~0 0))} [289] L138-1-->L143-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[] {12531#false} is VALID [2022-04-08 02:55:45,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {12531#false} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-08 02:55:45,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {12531#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-08 02:55:45,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {12531#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12531#false} is VALID [2022-04-08 02:55:45,042 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-08 02:55:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:45,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691035725] [2022-04-08 02:55:45,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691035725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:45,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:45,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012427548] [2022-04-08 02:55:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:45,043 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-08 02:55:45,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:45,043 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-08 02:55:45,057 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-08 02:55:45,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:45,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:45,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:45,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:45,058 INFO L87 Difference]: Start difference. First operand 593 states and 999 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-08 02:55:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,236 INFO L93 Difference]: Finished difference Result 889 states and 1493 transitions. [2022-04-08 02:55:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:45,236 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-08 02:55:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:45,236 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-08 02:55:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-08 02:55:45,237 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-08 02:55:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-08 02:55:45,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-08 02:55:45,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:45,374 INFO L225 Difference]: With dead ends: 889 [2022-04-08 02:55:45,374 INFO L226 Difference]: Without dead ends: 603 [2022-04-08 02:55:45,375 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-08 02:55:45,375 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:45,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-08 02:55:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-08 02:55:45,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:45,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,385 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,386 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,406 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-08 02:55:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-08 02:55:45,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:45,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:45,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 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 603 states. [2022-04-08 02:55:45,408 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 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 603 states. [2022-04-08 02:55:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,422 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-08 02:55:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-08 02:55:45,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:45,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:45,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:45,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 999 transitions. [2022-04-08 02:55:45,437 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 999 transitions. Word has length 27 [2022-04-08 02:55:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:45,438 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 999 transitions. [2022-04-08 02:55:45,438 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-08 02:55:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 999 transitions. [2022-04-08 02:55:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:55:45,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:45,439 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-08 02:55:45,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 02:55:45,439 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1504535879, now seen corresponding path program 1 times [2022-04-08 02:55:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:45,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331093298] [2022-04-08 02:55:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:45,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {15292#true} is VALID [2022-04-08 02:55:45,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {15292#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-08 02:55:45,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15292#true} {15292#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {15292#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:45,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {15298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {15292#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15292#true} {15292#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {15292#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {15292#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {15292#true} is VALID [2022-04-08 02:55:45,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {15292#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {15292#true} is VALID [2022-04-08 02:55:45,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {15292#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {15292#true} is VALID [2022-04-08 02:55:45,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {15292#true} [251] L78-->L78-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[] {15292#true} is VALID [2022-04-08 02:55:45,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {15292#true} [253] L78-2-->L82-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[] {15292#true} is VALID [2022-04-08 02:55:45,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {15292#true} [255] L82-1-->L86-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[] {15292#true} is VALID [2022-04-08 02:55:45,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {15292#true} [257] L86-1-->L90-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[] {15292#true} is VALID [2022-04-08 02:55:45,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {15292#true} [258] L90-1-->L94-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {15297#(= main_~lk5~0 1)} [260] L94-1-->L98-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {15297#(= main_~lk5~0 1)} [262] L98-1-->L102-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {15297#(= main_~lk5~0 1)} [264] L102-1-->L106-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {15297#(= main_~lk5~0 1)} [266] L106-1-->L110-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {15297#(= main_~lk5~0 1)} [268] L110-1-->L114-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] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {15297#(= main_~lk5~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {15297#(= main_~lk5~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {15297#(= main_~lk5~0 1)} [275] L122-1-->L128-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {15297#(= main_~lk5~0 1)} [279] L128-1-->L133-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {15297#(= main_~lk5~0 1)} [285] L133-1-->L138-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {15297#(= main_~lk5~0 1)} [289] L138-1-->L143-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[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {15297#(= main_~lk5~0 1)} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {15297#(= main_~lk5~0 1)} is VALID [2022-04-08 02:55:45,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {15297#(= main_~lk5~0 1)} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {15293#false} is VALID [2022-04-08 02:55:45,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {15293#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15293#false} is VALID [2022-04-08 02:55:45,478 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-08 02:55:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331093298] [2022-04-08 02:55:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331093298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:45,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:45,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908138926] [2022-04-08 02:55:45,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:45,479 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-08 02:55:45,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:45,479 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-08 02:55:45,493 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-08 02:55:45,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:45,494 INFO L87 Difference]: Start difference. First operand 601 states and 999 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-08 02:55:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,698 INFO L93 Difference]: Finished difference Result 1101 states and 1865 transitions. [2022-04-08 02:55:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:45,698 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-08 02:55:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:45,698 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-08 02:55:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 02:55:45,699 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-08 02:55:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 02:55:45,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 02:55:45,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:45,820 INFO L225 Difference]: With dead ends: 1101 [2022-04-08 02:55:45,821 INFO L226 Difference]: Without dead ends: 1099 [2022-04-08 02:55:45,821 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-08 02:55:45,822 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:45,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-08 02:55:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-08 02:55:45,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:45,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,848 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,849 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,886 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-08 02:55:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-08 02:55:45,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:45,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:45,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 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 1099 states. [2022-04-08 02:55:45,889 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 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 1099 states. [2022-04-08 02:55:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:45,929 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-08 02:55:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-08 02:55:45,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:45,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:45,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:45,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1367 transitions. [2022-04-08 02:55:45,958 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1367 transitions. Word has length 27 [2022-04-08 02:55:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:45,958 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1367 transitions. [2022-04-08 02:55:45,962 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-08 02:55:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1367 transitions. [2022-04-08 02:55:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:55:45,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:45,963 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-08 02:55:45,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 02:55:45,964 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1282879608, now seen corresponding path program 1 times [2022-04-08 02:55:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:45,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956466279] [2022-04-08 02:55:45,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:45,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:46,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {19506#true} is VALID [2022-04-08 02:55:46,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {19506#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-08 02:55:46,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19506#true} {19506#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-08 02:55:46,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {19506#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:46,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {19512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {19506#true} is VALID [2022-04-08 02:55:46,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {19506#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-08 02:55:46,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19506#true} {19506#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-08 02:55:46,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {19506#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19506#true} is VALID [2022-04-08 02:55:46,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {19506#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {19506#true} is VALID [2022-04-08 02:55:46,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {19506#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {19506#true} is VALID [2022-04-08 02:55:46,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {19506#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {19506#true} is VALID [2022-04-08 02:55:46,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {19506#true} [251] L78-->L78-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[] {19506#true} is VALID [2022-04-08 02:55:46,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {19506#true} [253] L78-2-->L82-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[] {19506#true} is VALID [2022-04-08 02:55:46,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {19506#true} [255] L82-1-->L86-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[] {19506#true} is VALID [2022-04-08 02:55:46,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {19506#true} [257] L86-1-->L90-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[] {19506#true} is VALID [2022-04-08 02:55:46,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {19506#true} [259] L90-1-->L94-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {19511#(= main_~p5~0 0)} [260] L94-1-->L98-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {19511#(= main_~p5~0 0)} [262] L98-1-->L102-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {19511#(= main_~p5~0 0)} [264] L102-1-->L106-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {19511#(= main_~p5~0 0)} [266] L106-1-->L110-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {19511#(= main_~p5~0 0)} [268] L110-1-->L114-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] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {19511#(= main_~p5~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {19511#(= main_~p5~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {19511#(= main_~p5~0 0)} [275] L122-1-->L128-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {19511#(= main_~p5~0 0)} [279] L128-1-->L133-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {19511#(= main_~p5~0 0)} [285] L133-1-->L138-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {19511#(= main_~p5~0 0)} [289] L138-1-->L143-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[] {19511#(= main_~p5~0 0)} is VALID [2022-04-08 02:55:46,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {19511#(= main_~p5~0 0)} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-08 02:55:46,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {19507#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-08 02:55:46,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {19507#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19507#false} is VALID [2022-04-08 02:55:46,014 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-08 02:55:46,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956466279] [2022-04-08 02:55:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956466279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:46,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:46,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669553979] [2022-04-08 02:55:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:46,014 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-08 02:55:46,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:46,015 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-08 02:55:46,028 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-08 02:55:46,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:46,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:46,029 INFO L87 Difference]: Start difference. First operand 841 states and 1367 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-08 02:55:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:46,295 INFO L93 Difference]: Finished difference Result 1981 states and 3241 transitions. [2022-04-08 02:55:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:46,295 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-08 02:55:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:46,295 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-08 02:55:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-08 02:55:46,296 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-08 02:55:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-08 02:55:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-08 02:55:46,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:46,458 INFO L225 Difference]: With dead ends: 1981 [2022-04-08 02:55:46,458 INFO L226 Difference]: Without dead ends: 1163 [2022-04-08 02:55:46,459 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-08 02:55:46,460 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:46,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-08 02:55:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-08 02:55:46,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:46,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:46,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:46,479 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:46,519 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-08 02:55:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-08 02:55:46,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:46,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1163 states. [2022-04-08 02:55:46,523 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1163 states. [2022-04-08 02:55:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:46,563 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-08 02:55:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-08 02:55:46,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:46,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:46,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:46,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1879 transitions. [2022-04-08 02:55:46,607 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1879 transitions. Word has length 27 [2022-04-08 02:55:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:46,607 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1879 transitions. [2022-04-08 02:55:46,607 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-08 02:55:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1879 transitions. [2022-04-08 02:55:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:55:46,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:46,608 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-08 02:55:46,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 02:55:46,608 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -603995456, now seen corresponding path program 1 times [2022-04-08 02:55:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413007056] [2022-04-08 02:55:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:46,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {25080#true} is VALID [2022-04-08 02:55:46,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {25080#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-08 02:55:46,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25080#true} {25080#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-08 02:55:46,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {25080#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {25086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {25080#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25080#true} {25080#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {25080#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {25080#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {25080#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {25080#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {25080#true} [251] L78-->L78-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[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {25080#true} [253] L78-2-->L82-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[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {25080#true} [255] L82-1-->L86-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[] {25080#true} is VALID [2022-04-08 02:55:46,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {25080#true} [257] L86-1-->L90-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[] {25080#true} is VALID [2022-04-08 02:55:46,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {25080#true} [258] L90-1-->L94-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {25085#(not (= main_~p5~0 0))} [260] L94-1-->L98-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {25085#(not (= main_~p5~0 0))} [262] L98-1-->L102-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {25085#(not (= main_~p5~0 0))} [264] L102-1-->L106-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {25085#(not (= main_~p5~0 0))} [266] L106-1-->L110-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {25085#(not (= main_~p5~0 0))} [268] L110-1-->L114-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] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {25085#(not (= main_~p5~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {25085#(not (= main_~p5~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {25085#(not (= main_~p5~0 0))} [275] L122-1-->L128-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {25085#(not (= main_~p5~0 0))} [279] L128-1-->L133-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {25085#(not (= main_~p5~0 0))} [285] L133-1-->L138-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {25085#(not (= main_~p5~0 0))} [289] L138-1-->L143-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[] {25085#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:55:46,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {25085#(not (= main_~p5~0 0))} [293] L143-1-->L148-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[] {25081#false} is VALID [2022-04-08 02:55:46,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {25081#false} [296] L148-1-->L154: 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[] {25081#false} is VALID [2022-04-08 02:55:46,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {25081#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {25081#false} is VALID [2022-04-08 02:55:46,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {25081#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25081#false} is VALID [2022-04-08 02:55:46,642 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-08 02:55:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413007056] [2022-04-08 02:55:46,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413007056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:46,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:46,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748346244] [2022-04-08 02:55:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:46,643 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-08 02:55:46,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:46,643 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-08 02:55:46,658 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-08 02:55:46,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:46,659 INFO L87 Difference]: Start difference. First operand 1161 states and 1879 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-08 02:55:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:46,926 INFO L93 Difference]: Finished difference Result 1741 states and 2809 transitions. [2022-04-08 02:55:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:46,926 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-08 02:55:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:46,927 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-08 02:55:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 02:55:46,928 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-08 02:55:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 02:55:46,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-08 02:55:47,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:47,084 INFO L225 Difference]: With dead ends: 1741 [2022-04-08 02:55:47,084 INFO L226 Difference]: Without dead ends: 1179 [2022-04-08 02:55:47,085 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-08 02:55:47,085 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:47,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:55:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-08 02:55:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-08 02:55:47,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:47,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,104 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,105 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:47,145 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-08 02:55:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-08 02:55:47,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:47,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:47,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1179 states. [2022-04-08 02:55:47,149 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 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 1179 states. [2022-04-08 02:55:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:47,188 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-08 02:55:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-08 02:55:47,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:47,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:47,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:47,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1879 transitions. [2022-04-08 02:55:47,231 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1879 transitions. Word has length 28 [2022-04-08 02:55:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:47,231 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1879 transitions. [2022-04-08 02:55:47,232 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-08 02:55:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1879 transitions. [2022-04-08 02:55:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:55:47,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:47,233 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-08 02:55:47,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 02:55:47,233 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1114529633, now seen corresponding path program 1 times [2022-04-08 02:55:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:47,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121641402] [2022-04-08 02:55:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:47,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {30462#true} is VALID [2022-04-08 02:55:47,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {30462#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-08 02:55:47,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30462#true} {30462#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-08 02:55:47,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {30462#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:47,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {30468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {30462#true} is VALID [2022-04-08 02:55:47,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {30462#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-08 02:55:47,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30462#true} {30462#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {30462#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {30462#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {30462#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {30462#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {30462#true} [251] L78-->L78-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[] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {30462#true} [253] L78-2-->L82-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[] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {30462#true} [255] L82-1-->L86-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[] {30462#true} is VALID [2022-04-08 02:55:47,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {30462#true} [257] L86-1-->L90-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[] {30462#true} is VALID [2022-04-08 02:55:47,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {30462#true} [259] L90-1-->L94-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[] {30462#true} is VALID [2022-04-08 02:55:47,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {30462#true} [260] L94-1-->L98-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {30467#(= main_~lk6~0 1)} [262] L98-1-->L102-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {30467#(= main_~lk6~0 1)} [264] L102-1-->L106-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {30467#(= main_~lk6~0 1)} [266] L106-1-->L110-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {30467#(= main_~lk6~0 1)} [268] L110-1-->L114-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] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {30467#(= main_~lk6~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {30467#(= main_~lk6~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {30467#(= main_~lk6~0 1)} [275] L122-1-->L128-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {30467#(= main_~lk6~0 1)} [279] L128-1-->L133-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {30467#(= main_~lk6~0 1)} [285] L133-1-->L138-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {30467#(= main_~lk6~0 1)} [289] L138-1-->L143-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {30467#(= main_~lk6~0 1)} [293] L143-1-->L148-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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {30467#(= main_~lk6~0 1)} [296] L148-1-->L154: 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[] {30467#(= main_~lk6~0 1)} is VALID [2022-04-08 02:55:47,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {30467#(= main_~lk6~0 1)} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {30463#false} is VALID [2022-04-08 02:55:47,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {30463#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30463#false} is VALID [2022-04-08 02:55:47,274 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-08 02:55:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:47,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121641402] [2022-04-08 02:55:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121641402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:47,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:47,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978560816] [2022-04-08 02:55:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:47,277 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-08 02:55:47,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:47,277 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-08 02:55:47,289 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-08 02:55:47,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:47,290 INFO L87 Difference]: Start difference. First operand 1177 states and 1879 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-08 02:55:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:47,571 INFO L93 Difference]: Finished difference Result 2125 states and 3465 transitions. [2022-04-08 02:55:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:47,572 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-08 02:55:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:47,572 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-08 02:55:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 02:55:47,573 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-08 02:55:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 02:55:47,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-08 02:55:47,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:47,787 INFO L225 Difference]: With dead ends: 2125 [2022-04-08 02:55:47,787 INFO L226 Difference]: Without dead ends: 2123 [2022-04-08 02:55:47,787 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-08 02:55:47,788 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:47,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-08 02:55:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-08 02:55:47,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:47,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,824 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,825 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:47,938 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-08 02:55:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-08 02:55:47,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:47,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:47,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 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 2123 states. [2022-04-08 02:55:47,944 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 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 2123 states. [2022-04-08 02:55:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:48,062 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-08 02:55:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-08 02:55:48,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:48,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:48,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:48,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2599 transitions. [2022-04-08 02:55:48,149 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2599 transitions. Word has length 28 [2022-04-08 02:55:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:48,149 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2599 transitions. [2022-04-08 02:55:48,149 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-08 02:55:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2599 transitions. [2022-04-08 02:55:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:55:48,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:48,151 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-08 02:55:48,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 02:55:48,151 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash 393022176, now seen corresponding path program 1 times [2022-04-08 02:55:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:48,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133142072] [2022-04-08 02:55:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:48,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {38628#true} is VALID [2022-04-08 02:55:48,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {38628#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-08 02:55:48,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38628#true} {38628#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {38628#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:48,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {38634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {38628#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38628#true} {38628#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {38628#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {38628#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {38628#true} is VALID [2022-04-08 02:55:48,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {38628#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {38628#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {38628#true} [251] L78-->L78-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[] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {38628#true} [253] L78-2-->L82-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[] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {38628#true} [255] L82-1-->L86-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[] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {38628#true} [257] L86-1-->L90-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[] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {38628#true} [259] L90-1-->L94-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[] {38628#true} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {38628#true} [261] L94-1-->L98-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {38633#(= main_~p6~0 0)} [262] L98-1-->L102-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {38633#(= main_~p6~0 0)} [264] L102-1-->L106-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {38633#(= main_~p6~0 0)} [266] L106-1-->L110-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {38633#(= main_~p6~0 0)} [268] L110-1-->L114-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] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {38633#(= main_~p6~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {38633#(= main_~p6~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {38633#(= main_~p6~0 0)} [275] L122-1-->L128-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {38633#(= main_~p6~0 0)} [279] L128-1-->L133-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {38633#(= main_~p6~0 0)} [285] L133-1-->L138-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {38633#(= main_~p6~0 0)} [289] L138-1-->L143-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {38633#(= main_~p6~0 0)} [293] L143-1-->L148-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[] {38633#(= main_~p6~0 0)} is VALID [2022-04-08 02:55:48,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {38633#(= main_~p6~0 0)} [296] L148-1-->L154: 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[] {38629#false} is VALID [2022-04-08 02:55:48,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {38629#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {38629#false} is VALID [2022-04-08 02:55:48,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {38629#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38629#false} is VALID [2022-04-08 02:55:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:55:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133142072] [2022-04-08 02:55:48,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133142072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:48,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:48,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191298290] [2022-04-08 02:55:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:48,190 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-08 02:55:48,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:48,190 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-08 02:55:48,204 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-08 02:55:48,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:48,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:48,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:48,205 INFO L87 Difference]: Start difference. First operand 1673 states and 2599 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-08 02:55:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:48,816 INFO L93 Difference]: Finished difference Result 3917 states and 6121 transitions. [2022-04-08 02:55:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:48,817 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-08 02:55:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:48,817 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-08 02:55:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-08 02:55:48,818 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-08 02:55:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-08 02:55:48,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-08 02:55:48,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:49,088 INFO L225 Difference]: With dead ends: 3917 [2022-04-08 02:55:49,088 INFO L226 Difference]: Without dead ends: 2283 [2022-04-08 02:55:49,090 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-08 02:55:49,091 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:49,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-08 02:55:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-08 02:55:49,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:49,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:49,149 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:49,151 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:49,284 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-08 02:55:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-08 02:55:49,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:49,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:49,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-08 02:55:49,290 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-08 02:55:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:49,424 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-08 02:55:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-08 02:55:49,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:49,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:49,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:49,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3527 transitions. [2022-04-08 02:55:49,569 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3527 transitions. Word has length 28 [2022-04-08 02:55:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:49,569 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3527 transitions. [2022-04-08 02:55:49,570 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-08 02:55:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3527 transitions. [2022-04-08 02:55:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:55:49,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:49,571 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-08 02:55:49,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 02:55:49,571 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -190647580, now seen corresponding path program 1 times [2022-04-08 02:55:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:49,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679726128] [2022-04-08 02:55:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:49,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {49578#true} is VALID [2022-04-08 02:55:49,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {49578#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-08 02:55:49,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49578#true} {49578#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-08 02:55:49,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {49578#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:49,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {49584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {49578#true} is VALID [2022-04-08 02:55:49,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {49578#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-08 02:55:49,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49578#true} {49578#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-08 02:55:49,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {49578#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {49578#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {49578#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {49578#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {49578#true} [251] L78-->L78-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[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {49578#true} [253] L78-2-->L82-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[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {49578#true} [255] L82-1-->L86-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[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {49578#true} [257] L86-1-->L90-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[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {49578#true} [259] L90-1-->L94-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[] {49578#true} is VALID [2022-04-08 02:55:49,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {49578#true} [260] L94-1-->L98-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {49583#(not (= main_~p6~0 0))} [262] L98-1-->L102-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {49583#(not (= main_~p6~0 0))} [264] L102-1-->L106-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {49583#(not (= main_~p6~0 0))} [266] L106-1-->L110-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {49583#(not (= main_~p6~0 0))} [268] L110-1-->L114-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] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {49583#(not (= main_~p6~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {49583#(not (= main_~p6~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {49583#(not (= main_~p6~0 0))} [275] L122-1-->L128-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {49583#(not (= main_~p6~0 0))} [279] L128-1-->L133-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {49583#(not (= main_~p6~0 0))} [285] L133-1-->L138-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {49583#(not (= main_~p6~0 0))} [289] L138-1-->L143-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {49583#(not (= main_~p6~0 0))} [293] L143-1-->L148-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[] {49583#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:55:49,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {49583#(not (= main_~p6~0 0))} [297] L148-1-->L153-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[] {49579#false} is VALID [2022-04-08 02:55:49,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {49579#false} [300] L153-1-->L159: 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[] {49579#false} is VALID [2022-04-08 02:55:49,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {49579#false} [302] L159-->L184-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[] {49579#false} is VALID [2022-04-08 02:55:49,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {49579#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49579#false} is VALID [2022-04-08 02:55:49,624 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-08 02:55:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679726128] [2022-04-08 02:55:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679726128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:49,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:49,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705207073] [2022-04-08 02:55:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:49,625 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-08 02:55:49,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:49,625 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-08 02:55:49,640 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-08 02:55:49,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:49,641 INFO L87 Difference]: Start difference. First operand 2281 states and 3527 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-08 02:55:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:50,140 INFO L93 Difference]: Finished difference Result 3421 states and 5273 transitions. [2022-04-08 02:55:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:50,140 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-08 02:55:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:50,140 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-08 02:55:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 02:55:50,141 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-08 02:55:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 02:55:50,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-08 02:55:50,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:50,403 INFO L225 Difference]: With dead ends: 3421 [2022-04-08 02:55:50,404 INFO L226 Difference]: Without dead ends: 2315 [2022-04-08 02:55:50,405 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-08 02:55:50,406 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:50,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-08 02:55:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-08 02:55:50,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:50,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:50,471 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:50,474 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:50,616 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-08 02:55:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-08 02:55:50,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:50,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:50,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 02:55:50,625 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-08 02:55:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:50,766 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-08 02:55:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-08 02:55:50,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:50,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:50,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:50,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3527 transitions. [2022-04-08 02:55:50,918 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3527 transitions. Word has length 29 [2022-04-08 02:55:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:50,918 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3527 transitions. [2022-04-08 02:55:50,918 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-08 02:55:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3527 transitions. [2022-04-08 02:55:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:55:50,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:50,920 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-08 02:55:50,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 02:55:50,920 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -701181757, now seen corresponding path program 1 times [2022-04-08 02:55:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311731382] [2022-04-08 02:55:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:50,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {60128#true} is VALID [2022-04-08 02:55:50,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {60128#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-08 02:55:50,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60128#true} {60128#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {60128#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {60134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {60128#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60128#true} {60128#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {60128#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {60128#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {60128#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {60128#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {60128#true} is VALID [2022-04-08 02:55:50,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {60128#true} [251] L78-->L78-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {60128#true} [253] L78-2-->L82-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {60128#true} [255] L82-1-->L86-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {60128#true} [257] L86-1-->L90-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {60128#true} [259] L90-1-->L94-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {60128#true} [261] L94-1-->L98-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[] {60128#true} is VALID [2022-04-08 02:55:50,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {60128#true} [262] L98-1-->L102-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {60133#(= main_~lk7~0 1)} [264] L102-1-->L106-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {60133#(= main_~lk7~0 1)} [266] L106-1-->L110-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {60133#(= main_~lk7~0 1)} [268] L110-1-->L114-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] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {60133#(= main_~lk7~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {60133#(= main_~lk7~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {60133#(= main_~lk7~0 1)} [275] L122-1-->L128-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {60133#(= main_~lk7~0 1)} [279] L128-1-->L133-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {60133#(= main_~lk7~0 1)} [285] L133-1-->L138-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {60133#(= main_~lk7~0 1)} [289] L138-1-->L143-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {60133#(= main_~lk7~0 1)} [293] L143-1-->L148-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {60133#(= main_~lk7~0 1)} [297] L148-1-->L153-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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {60133#(= main_~lk7~0 1)} [300] L153-1-->L159: 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[] {60133#(= main_~lk7~0 1)} is VALID [2022-04-08 02:55:50,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {60133#(= main_~lk7~0 1)} [302] L159-->L184-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[] {60129#false} is VALID [2022-04-08 02:55:50,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {60129#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60129#false} is VALID [2022-04-08 02:55:50,974 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-08 02:55:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:50,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311731382] [2022-04-08 02:55:50,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311731382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:50,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:50,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458773924] [2022-04-08 02:55:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:50,976 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-08 02:55:50,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:50,976 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-08 02:55:50,990 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-08 02:55:50,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:50,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:50,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:50,991 INFO L87 Difference]: Start difference. First operand 2313 states and 3527 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-08 02:55:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:51,630 INFO L93 Difference]: Finished difference Result 4109 states and 6409 transitions. [2022-04-08 02:55:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:51,630 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-08 02:55:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:51,630 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-08 02:55:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 02:55:51,631 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-08 02:55:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 02:55:51,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-08 02:55:51,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:52,219 INFO L225 Difference]: With dead ends: 4109 [2022-04-08 02:55:52,219 INFO L226 Difference]: Without dead ends: 4107 [2022-04-08 02:55:52,221 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-08 02:55:52,221 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:52,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-08 02:55:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-08 02:55:52,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:52,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:52,288 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:52,292 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:52,801 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-08 02:55:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-08 02:55:52,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:52,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:52,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 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 4107 states. [2022-04-08 02:55:52,818 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 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 4107 states. [2022-04-08 02:55:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:53,294 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-08 02:55:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-08 02:55:53,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:53,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:53,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:53,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4935 transitions. [2022-04-08 02:55:53,636 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4935 transitions. Word has length 29 [2022-04-08 02:55:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:53,636 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4935 transitions. [2022-04-08 02:55:53,636 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-08 02:55:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4935 transitions. [2022-04-08 02:55:53,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:55:53,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:53,638 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-08 02:55:53,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 02:55:53,639 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash 806370052, now seen corresponding path program 1 times [2022-04-08 02:55:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:53,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279289108] [2022-04-08 02:55:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:53,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {76006#true} is VALID [2022-04-08 02:55:53,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {76006#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-08 02:55:53,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76006#true} {76006#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {76006#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {76012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {76006#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76006#true} {76006#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {76006#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {76006#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {76006#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {76006#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {76006#true} is VALID [2022-04-08 02:55:53,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {76006#true} [251] L78-->L78-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {76006#true} [253] L78-2-->L82-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {76006#true} [255] L82-1-->L86-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {76006#true} [257] L86-1-->L90-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {76006#true} [259] L90-1-->L94-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {76006#true} [261] L94-1-->L98-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[] {76006#true} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {76006#true} [263] L98-1-->L102-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {76011#(= main_~p7~0 0)} [264] L102-1-->L106-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] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {76011#(= main_~p7~0 0)} [266] L106-1-->L110-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] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {76011#(= main_~p7~0 0)} [268] L110-1-->L114-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] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {76011#(= main_~p7~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {76011#(= main_~p7~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {76011#(= main_~p7~0 0)} [275] L122-1-->L128-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {76011#(= main_~p7~0 0)} [279] L128-1-->L133-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {76011#(= main_~p7~0 0)} [285] L133-1-->L138-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {76011#(= main_~p7~0 0)} [289] L138-1-->L143-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {76011#(= main_~p7~0 0)} [293] L143-1-->L148-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {76011#(= main_~p7~0 0)} [297] L148-1-->L153-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[] {76011#(= main_~p7~0 0)} is VALID [2022-04-08 02:55:53,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {76011#(= main_~p7~0 0)} [300] L153-1-->L159: 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[] {76007#false} is VALID [2022-04-08 02:55:53,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {76007#false} [302] L159-->L184-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[] {76007#false} is VALID [2022-04-08 02:55:53,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {76007#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76007#false} is VALID [2022-04-08 02:55:53,668 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-08 02:55:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:53,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279289108] [2022-04-08 02:55:53,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279289108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:53,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:53,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302146404] [2022-04-08 02:55:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:53,669 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-08 02:55:53,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:53,669 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-08 02:55:53,691 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-08 02:55:53,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:53,692 INFO L87 Difference]: Start difference. First operand 3337 states and 4935 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-08 02:55:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:55,633 INFO L93 Difference]: Finished difference Result 7757 states and 11529 transitions. [2022-04-08 02:55:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:55,633 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-08 02:55:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:55,633 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-08 02:55:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 02:55:55,634 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-08 02:55:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 02:55:55,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-08 02:55:55,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:55:56,295 INFO L225 Difference]: With dead ends: 7757 [2022-04-08 02:55:56,295 INFO L226 Difference]: Without dead ends: 4491 [2022-04-08 02:55:56,298 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-08 02:55:56,299 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:55:56,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:55:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-08 02:55:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-08 02:55:56,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:55:56,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:56,364 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:56,368 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:56,913 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-08 02:55:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-08 02:55:56,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:56,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:56,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 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 4491 states. [2022-04-08 02:55:56,926 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 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 4491 states. [2022-04-08 02:55:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:57,493 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-08 02:55:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-08 02:55:57,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:55:57,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:55:57,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:55:57,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:55:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:55:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6599 transitions. [2022-04-08 02:55:58,113 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6599 transitions. Word has length 29 [2022-04-08 02:55:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:55:58,113 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6599 transitions. [2022-04-08 02:55:58,113 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-08 02:55:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6599 transitions. [2022-04-08 02:55:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:55:58,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:55:58,116 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-08 02:55:58,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 02:55:58,116 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:55:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:55:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -261765188, now seen corresponding path program 1 times [2022-04-08 02:55:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:55:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173247640] [2022-04-08 02:55:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:55:58,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:55:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:55:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:55:58,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {97580#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97580#true} {97580#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {97580#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:55:58,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {97586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {97580#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97580#true} {97580#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-08 02:55:58,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {97580#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {97580#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {97580#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {97580#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {97580#true} [251] L78-->L78-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[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {97580#true} [253] L78-2-->L82-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[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {97580#true} [255] L82-1-->L86-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[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {97580#true} [257] L86-1-->L90-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[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {97580#true} [259] L90-1-->L94-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[] {97580#true} is VALID [2022-04-08 02:55:58,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {97580#true} [261] L94-1-->L98-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[] {97580#true} is VALID [2022-04-08 02:55:58,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {97580#true} [262] L98-1-->L102-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {97585#(not (= main_~p7~0 0))} [264] L102-1-->L106-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {97585#(not (= main_~p7~0 0))} [266] L106-1-->L110-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {97585#(not (= main_~p7~0 0))} [268] L110-1-->L114-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] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {97585#(not (= main_~p7~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {97585#(not (= main_~p7~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {97585#(not (= main_~p7~0 0))} [275] L122-1-->L128-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {97585#(not (= main_~p7~0 0))} [279] L128-1-->L133-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {97585#(not (= main_~p7~0 0))} [285] L133-1-->L138-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {97585#(not (= main_~p7~0 0))} [289] L138-1-->L143-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {97585#(not (= main_~p7~0 0))} [293] L143-1-->L148-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {97585#(not (= main_~p7~0 0))} [297] L148-1-->L153-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[] {97585#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:55:58,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {97585#(not (= main_~p7~0 0))} [301] L153-1-->L158-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[] {97581#false} is VALID [2022-04-08 02:55:58,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {97581#false} [304] L158-1-->L164: 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[] {97581#false} is VALID [2022-04-08 02:55:58,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {97581#false} [306] L164-->L184-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[] {97581#false} is VALID [2022-04-08 02:55:58,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {97581#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97581#false} is VALID [2022-04-08 02:55:58,172 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-08 02:55:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:55:58,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173247640] [2022-04-08 02:55:58,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173247640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:55:58,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:55:58,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:55:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746761863] [2022-04-08 02:55:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:55:58,173 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-08 02:55:58,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:55:58,173 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-08 02:55:58,190 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-08 02:55:58,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:55:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:55:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:55:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:55:58,191 INFO L87 Difference]: Start difference. First operand 4489 states and 6599 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-08 02:55:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:55:59,777 INFO L93 Difference]: Finished difference Result 6733 states and 9865 transitions. [2022-04-08 02:55:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:55:59,777 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-08 02:55:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:55:59,778 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-08 02:55:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 02:55:59,779 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-08 02:55:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 02:55:59,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-08 02:55:59,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:00,531 INFO L225 Difference]: With dead ends: 6733 [2022-04-08 02:56:00,531 INFO L226 Difference]: Without dead ends: 4555 [2022-04-08 02:56:00,534 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-08 02:56:00,535 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:00,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-08 02:56:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-08 02:56:00,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:00,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:00,608 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:00,611 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:01,144 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-08 02:56:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-08 02:56:01,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:01,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:01,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 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 4555 states. [2022-04-08 02:56:01,154 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 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 4555 states. [2022-04-08 02:56:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:01,711 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-08 02:56:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-08 02:56:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:01,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:01,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6599 transitions. [2022-04-08 02:56:02,297 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6599 transitions. Word has length 30 [2022-04-08 02:56:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:02,297 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6599 transitions. [2022-04-08 02:56:02,297 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-08 02:56:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6599 transitions. [2022-04-08 02:56:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:56:02,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:02,299 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-08 02:56:02,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 02:56:02,299 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -772299365, now seen corresponding path program 1 times [2022-04-08 02:56:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:02,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771750395] [2022-04-08 02:56:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:02,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {118322#true} is VALID [2022-04-08 02:56:02,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {118322#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-08 02:56:02,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118322#true} {118322#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {118322#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {118322#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118322#true} {118322#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {118322#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {118322#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {118322#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {118322#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {118322#true} is VALID [2022-04-08 02:56:02,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {118322#true} [251] L78-->L78-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {118322#true} [253] L78-2-->L82-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {118322#true} [255] L82-1-->L86-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {118322#true} [257] L86-1-->L90-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {118322#true} [259] L90-1-->L94-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {118322#true} [261] L94-1-->L98-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {118322#true} [263] L98-1-->L102-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[] {118322#true} is VALID [2022-04-08 02:56:02,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {118322#true} [264] L102-1-->L106-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] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {118327#(= main_~lk8~0 1)} [266] L106-1-->L110-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] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {118327#(= main_~lk8~0 1)} [268] L110-1-->L114-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] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {118327#(= main_~lk8~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {118327#(= main_~lk8~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {118327#(= main_~lk8~0 1)} [275] L122-1-->L128-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {118327#(= main_~lk8~0 1)} [279] L128-1-->L133-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {118327#(= main_~lk8~0 1)} [285] L133-1-->L138-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {118327#(= main_~lk8~0 1)} [289] L138-1-->L143-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {118327#(= main_~lk8~0 1)} [293] L143-1-->L148-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {118327#(= main_~lk8~0 1)} [297] L148-1-->L153-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {118327#(= main_~lk8~0 1)} [301] L153-1-->L158-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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {118327#(= main_~lk8~0 1)} [304] L158-1-->L164: 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[] {118327#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:02,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {118327#(= main_~lk8~0 1)} [306] L164-->L184-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[] {118323#false} is VALID [2022-04-08 02:56:02,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {118323#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118323#false} is VALID [2022-04-08 02:56:02,332 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-08 02:56:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:02,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771750395] [2022-04-08 02:56:02,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771750395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:02,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:02,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486591650] [2022-04-08 02:56:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:02,333 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-08 02:56:02,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:02,333 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-08 02:56:02,348 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-08 02:56:02,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:02,349 INFO L87 Difference]: Start difference. First operand 4553 states and 6599 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-08 02:56:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:04,228 INFO L93 Difference]: Finished difference Result 7949 states and 11785 transitions. [2022-04-08 02:56:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:04,228 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-08 02:56:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:04,229 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-08 02:56:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 02:56:04,229 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-08 02:56:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 02:56:04,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 02:56:04,307 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-08 02:56:06,090 INFO L225 Difference]: With dead ends: 7949 [2022-04-08 02:56:06,091 INFO L226 Difference]: Without dead ends: 7947 [2022-04-08 02:56:06,092 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-08 02:56:06,093 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:06,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-08 02:56:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-08 02:56:06,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:06,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:06,231 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:06,240 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:08,085 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-08 02:56:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-08 02:56:08,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:08,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:08,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 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 7947 states. [2022-04-08 02:56:08,100 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 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 7947 states. [2022-04-08 02:56:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:09,877 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-08 02:56:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-08 02:56:09,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:09,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:09,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:09,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9351 transitions. [2022-04-08 02:56:11,375 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9351 transitions. Word has length 30 [2022-04-08 02:56:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:11,375 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9351 transitions. [2022-04-08 02:56:11,375 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-08 02:56:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9351 transitions. [2022-04-08 02:56:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:56:11,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:11,390 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-08 02:56:11,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 02:56:11,390 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 735252444, now seen corresponding path program 1 times [2022-04-08 02:56:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:11,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642517280] [2022-04-08 02:56:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:11,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {149240#true} is VALID [2022-04-08 02:56:11,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {149240#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-08 02:56:11,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149240#true} {149240#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {149240#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:11,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {149246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {149240#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149240#true} {149240#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {149240#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {149240#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {149240#true} is VALID [2022-04-08 02:56:11,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {149240#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {149240#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {149240#true} [251] L78-->L78-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {149240#true} [253] L78-2-->L82-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {149240#true} [255] L82-1-->L86-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {149240#true} [257] L86-1-->L90-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {149240#true} [259] L90-1-->L94-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {149240#true} [261] L94-1-->L98-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {149240#true} [263] L98-1-->L102-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[] {149240#true} is VALID [2022-04-08 02:56:11,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {149240#true} [265] L102-1-->L106-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {149245#(= main_~p8~0 0)} [266] L106-1-->L110-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] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {149245#(= main_~p8~0 0)} [268] L110-1-->L114-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] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {149245#(= main_~p8~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {149245#(= main_~p8~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {149245#(= main_~p8~0 0)} [275] L122-1-->L128-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {149245#(= main_~p8~0 0)} [279] L128-1-->L133-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {149245#(= main_~p8~0 0)} [285] L133-1-->L138-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {149245#(= main_~p8~0 0)} [289] L138-1-->L143-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {149245#(= main_~p8~0 0)} [293] L143-1-->L148-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {149245#(= main_~p8~0 0)} [297] L148-1-->L153-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {149245#(= main_~p8~0 0)} [301] L153-1-->L158-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[] {149245#(= main_~p8~0 0)} is VALID [2022-04-08 02:56:11,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {149245#(= main_~p8~0 0)} [304] L158-1-->L164: 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[] {149241#false} is VALID [2022-04-08 02:56:11,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {149241#false} [306] L164-->L184-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[] {149241#false} is VALID [2022-04-08 02:56:11,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {149241#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149241#false} is VALID [2022-04-08 02:56:11,451 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-08 02:56:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:11,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642517280] [2022-04-08 02:56:11,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642517280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:11,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:11,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968565424] [2022-04-08 02:56:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:11,451 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-08 02:56:11,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:11,452 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-08 02:56:11,467 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-08 02:56:11,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:11,468 INFO L87 Difference]: Start difference. First operand 6665 states and 9351 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-08 02:56:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:18,059 INFO L93 Difference]: Finished difference Result 15373 states and 21641 transitions. [2022-04-08 02:56:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:18,059 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-08 02:56:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:18,059 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-08 02:56:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-08 02:56:18,061 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-08 02:56:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-08 02:56:18,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-08 02:56:18,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:20,226 INFO L225 Difference]: With dead ends: 15373 [2022-04-08 02:56:20,227 INFO L226 Difference]: Without dead ends: 8843 [2022-04-08 02:56:20,231 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-08 02:56:20,231 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:20,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-08 02:56:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-08 02:56:20,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:20,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,348 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,355 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,521 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-08 02:56:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-08 02:56:22,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:22,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:22,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 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 8843 states. [2022-04-08 02:56:22,538 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 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 8843 states. [2022-04-08 02:56:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:24,727 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-08 02:56:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-08 02:56:24,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:24,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:24,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:24,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12295 transitions. [2022-04-08 02:56:27,062 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12295 transitions. Word has length 30 [2022-04-08 02:56:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:27,062 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12295 transitions. [2022-04-08 02:56:27,062 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-08 02:56:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12295 transitions. [2022-04-08 02:56:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:56:27,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:27,066 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, 1] [2022-04-08 02:56:27,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 02:56:27,066 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1828556384, now seen corresponding path program 1 times [2022-04-08 02:56:27,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:27,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192367987] [2022-04-08 02:56:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:27,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {191806#true} is VALID [2022-04-08 02:56:27,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {191806#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-08 02:56:27,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191806#true} {191806#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {191806#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {191812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {191806#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191806#true} {191806#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {191806#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {191806#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {191806#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {191806#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {191806#true} [251] L78-->L78-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[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {191806#true} [253] L78-2-->L82-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[] {191806#true} is VALID [2022-04-08 02:56:27,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {191806#true} [255] L82-1-->L86-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[] {191806#true} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {191806#true} [257] L86-1-->L90-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[] {191806#true} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {191806#true} [259] L90-1-->L94-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[] {191806#true} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {191806#true} [261] L94-1-->L98-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[] {191806#true} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {191806#true} [263] L98-1-->L102-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[] {191806#true} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {191806#true} [264] L102-1-->L106-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] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {191811#(not (= main_~p8~0 0))} [266] L106-1-->L110-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] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {191811#(not (= main_~p8~0 0))} [268] L110-1-->L114-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] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {191811#(not (= main_~p8~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {191811#(not (= main_~p8~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {191811#(not (= main_~p8~0 0))} [275] L122-1-->L128-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {191811#(not (= main_~p8~0 0))} [279] L128-1-->L133-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {191811#(not (= main_~p8~0 0))} [285] L133-1-->L138-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {191811#(not (= main_~p8~0 0))} [289] L138-1-->L143-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {191811#(not (= main_~p8~0 0))} [293] L143-1-->L148-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {191811#(not (= main_~p8~0 0))} [297] L148-1-->L153-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {191811#(not (= main_~p8~0 0))} [301] L153-1-->L158-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[] {191811#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {191811#(not (= main_~p8~0 0))} [305] L158-1-->L163-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[] {191807#false} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {191807#false} [308] L163-1-->L169: 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[] {191807#false} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {191807#false} [310] L169-->L184-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[] {191807#false} is VALID [2022-04-08 02:56:27,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {191807#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191807#false} is VALID [2022-04-08 02:56:27,128 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-08 02:56:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192367987] [2022-04-08 02:56:27,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192367987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:27,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:27,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287608636] [2022-04-08 02:56:27,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:56:27,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:27,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:27,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:27,161 INFO L87 Difference]: Start difference. First operand 8841 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:32,657 INFO L93 Difference]: Finished difference Result 13261 states and 18377 transitions. [2022-04-08 02:56:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:56:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-08 02:56:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-08 02:56:32,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-08 02:56:32,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:34,999 INFO L225 Difference]: With dead ends: 13261 [2022-04-08 02:56:35,000 INFO L226 Difference]: Without dead ends: 8971 [2022-04-08 02:56:35,003 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-08 02:56:35,004 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:35,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-08 02:56:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-08 02:56:35,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:35,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:35,142 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:35,152 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:37,285 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-08 02:56:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-08 02:56:37,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:37,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:37,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 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 8971 states. [2022-04-08 02:56:37,307 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 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 8971 states. [2022-04-08 02:56:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,522 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-08 02:56:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-08 02:56:39,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:39,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:39,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:39,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12295 transitions. [2022-04-08 02:56:41,808 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12295 transitions. Word has length 31 [2022-04-08 02:56:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:41,809 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12295 transitions. [2022-04-08 02:56:41,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12295 transitions. [2022-04-08 02:56:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:56:41,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:41,813 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, 1] [2022-04-08 02:56:41,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 02:56:41,814 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1318022207, now seen corresponding path program 1 times [2022-04-08 02:56:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:41,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117830772] [2022-04-08 02:56:41,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:41,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {232644#true} is VALID [2022-04-08 02:56:41,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {232644#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-08 02:56:41,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232644#true} {232644#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {232644#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {232650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {232644#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232644#true} {232644#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {232644#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {232644#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {232644#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {232644#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {232644#true} is VALID [2022-04-08 02:56:41,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {232644#true} [251] L78-->L78-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {232644#true} [253] L78-2-->L82-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {232644#true} [255] L82-1-->L86-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {232644#true} [257] L86-1-->L90-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {232644#true} [259] L90-1-->L94-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {232644#true} [261] L94-1-->L98-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {232644#true} [263] L98-1-->L102-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {232644#true} [265] L102-1-->L106-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[] {232644#true} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {232644#true} [266] L106-1-->L110-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] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {232649#(= main_~lk9~0 1)} [268] L110-1-->L114-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] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {232649#(= main_~lk9~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {232649#(= main_~lk9~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {232649#(= main_~lk9~0 1)} [275] L122-1-->L128-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {232649#(= main_~lk9~0 1)} [279] L128-1-->L133-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {232649#(= main_~lk9~0 1)} [285] L133-1-->L138-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {232649#(= main_~lk9~0 1)} [289] L138-1-->L143-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {232649#(= main_~lk9~0 1)} [293] L143-1-->L148-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {232649#(= main_~lk9~0 1)} [297] L148-1-->L153-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {232649#(= main_~lk9~0 1)} [301] L153-1-->L158-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {232649#(= main_~lk9~0 1)} [305] L158-1-->L163-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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {232649#(= main_~lk9~0 1)} [308] L163-1-->L169: 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[] {232649#(= main_~lk9~0 1)} is VALID [2022-04-08 02:56:41,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {232649#(= main_~lk9~0 1)} [310] L169-->L184-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[] {232645#false} is VALID [2022-04-08 02:56:41,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {232645#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232645#false} is VALID [2022-04-08 02:56:41,850 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-08 02:56:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:41,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117830772] [2022-04-08 02:56:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117830772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95158641] [2022-04-08 02:56:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:41,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:56:41,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:41,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:41,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:41,866 INFO L87 Difference]: Start difference. First operand 8969 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:48,610 INFO L93 Difference]: Finished difference Result 15373 states and 21513 transitions. [2022-04-08 02:56:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:48,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:56:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 02:56:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 02:56:48,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 02:56:48,731 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-08 02:56:55,410 INFO L225 Difference]: With dead ends: 15373 [2022-04-08 02:56:55,410 INFO L226 Difference]: Without dead ends: 15371 [2022-04-08 02:56:55,412 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-08 02:56:55,412 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:55,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-08 02:56:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-08 02:56:55,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:55,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,587 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,598 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:02,022 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-08 02:57:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-08 02:57:02,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:02,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:02,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 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 15371 states. [2022-04-08 02:57:02,050 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 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 15371 states. [2022-04-08 02:57:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:07,798 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-08 02:57:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-08 02:57:07,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:07,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:07,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:07,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 17671 transitions. [2022-04-08 02:57:13,147 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 17671 transitions. Word has length 31 [2022-04-08 02:57:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:13,147 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 17671 transitions. [2022-04-08 02:57:13,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 17671 transitions. [2022-04-08 02:57:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:57:13,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:13,154 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, 1] [2022-04-08 02:57:13,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 02:57:13,155 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1469393280, now seen corresponding path program 1 times [2022-04-08 02:57:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632503115] [2022-04-08 02:57:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:13,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {292874#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292874#true} {292874#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {292874#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:13,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {292880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {292874#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292874#true} {292874#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-08 02:57:13,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {292874#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {292874#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {292874#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {292874#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {292874#true} [251] L78-->L78-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {292874#true} [253] L78-2-->L82-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {292874#true} [255] L82-1-->L86-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {292874#true} [257] L86-1-->L90-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {292874#true} [259] L90-1-->L94-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {292874#true} [261] L94-1-->L98-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {292874#true} [263] L98-1-->L102-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {292874#true} [265] L102-1-->L106-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[] {292874#true} is VALID [2022-04-08 02:57:13,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {292874#true} [267] L106-1-->L110-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {292879#(= main_~p9~0 0)} [268] L110-1-->L114-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] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {292879#(= main_~p9~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {292879#(= main_~p9~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {292879#(= main_~p9~0 0)} [275] L122-1-->L128-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {292879#(= main_~p9~0 0)} [279] L128-1-->L133-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {292879#(= main_~p9~0 0)} [285] L133-1-->L138-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {292879#(= main_~p9~0 0)} [289] L138-1-->L143-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {292879#(= main_~p9~0 0)} [293] L143-1-->L148-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {292879#(= main_~p9~0 0)} [297] L148-1-->L153-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {292879#(= main_~p9~0 0)} [301] L153-1-->L158-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {292879#(= main_~p9~0 0)} [305] L158-1-->L163-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[] {292879#(= main_~p9~0 0)} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {292879#(= main_~p9~0 0)} [308] L163-1-->L169: 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[] {292875#false} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {292875#false} [310] L169-->L184-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[] {292875#false} is VALID [2022-04-08 02:57:13,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {292875#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292875#false} is VALID [2022-04-08 02:57:13,184 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-08 02:57:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:13,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632503115] [2022-04-08 02:57:13,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632503115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146184397] [2022-04-08 02:57:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:57:13,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:13,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:13,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:13,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:13,200 INFO L87 Difference]: Start difference. First operand 13321 states and 17671 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:45,313 INFO L93 Difference]: Finished difference Result 30477 states and 40457 transitions. [2022-04-08 02:57:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-08 02:57:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 02:57:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 02:57:45,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-08 02:57:45,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:53,621 INFO L225 Difference]: With dead ends: 30477 [2022-04-08 02:57:53,621 INFO L226 Difference]: Without dead ends: 17419 [2022-04-08 02:57:53,631 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-08 02:57:53,631 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:53,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-08 02:57:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-08 02:57:53,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:53,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:53,878 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:53,893 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:01,919 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-08 02:58:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-08 02:58:01,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:58:01,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:58:01,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 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 17419 states. [2022-04-08 02:58:02,002 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 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 17419 states. [2022-04-08 02:58:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:10,631 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-08 02:58:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-08 02:58:10,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:58:10,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:58:10,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:58:10,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:58:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 22791 transitions. [2022-04-08 02:58:19,048 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 22791 transitions. Word has length 31 [2022-04-08 02:58:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:58:19,048 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 22791 transitions. [2022-04-08 02:58:19,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 22791 transitions. [2022-04-08 02:58:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 02:58:19,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:58:19,056 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, 1, 1] [2022-04-08 02:58:19,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 02:58:19,056 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:58:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:58:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2090951496, now seen corresponding path program 1 times [2022-04-08 02:58:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:58:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268084947] [2022-04-08 02:58:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:58:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:58:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:58:19,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:58:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:58:19,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {376912#true} is VALID [2022-04-08 02:58:19,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {376912#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-08 02:58:19,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376912#true} {376912#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {376912#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {376918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {376912#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376912#true} {376912#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {376912#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {376912#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {376912#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {376912#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {376912#true} [251] L78-->L78-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[] {376912#true} is VALID [2022-04-08 02:58:19,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {376912#true} [253] L78-2-->L82-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {376912#true} [255] L82-1-->L86-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {376912#true} [257] L86-1-->L90-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {376912#true} [259] L90-1-->L94-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {376912#true} [261] L94-1-->L98-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {376912#true} [263] L98-1-->L102-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {376912#true} [265] L102-1-->L106-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[] {376912#true} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {376912#true} [266] L106-1-->L110-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] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {376917#(not (= main_~p9~0 0))} [268] L110-1-->L114-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] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {376917#(not (= main_~p9~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {376917#(not (= main_~p9~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {376917#(not (= main_~p9~0 0))} [275] L122-1-->L128-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {376917#(not (= main_~p9~0 0))} [279] L128-1-->L133-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {376917#(not (= main_~p9~0 0))} [285] L133-1-->L138-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {376917#(not (= main_~p9~0 0))} [289] L138-1-->L143-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {376917#(not (= main_~p9~0 0))} [293] L143-1-->L148-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {376917#(not (= main_~p9~0 0))} [297] L148-1-->L153-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {376917#(not (= main_~p9~0 0))} [301] L153-1-->L158-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {376917#(not (= main_~p9~0 0))} [305] L158-1-->L163-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[] {376917#(not (= main_~p9~0 0))} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {376917#(not (= main_~p9~0 0))} [309] L163-1-->L168-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[] {376913#false} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {376913#false} [312] L168-1-->L174: 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[] {376913#false} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {376913#false} [314] L174-->L184-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[] {376913#false} is VALID [2022-04-08 02:58:19,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {376913#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376913#false} is VALID [2022-04-08 02:58:19,102 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-08 02:58:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:58:19,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268084947] [2022-04-08 02:58:19,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268084947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:58:19,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:58:19,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:58:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988231705] [2022-04-08 02:58:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:58:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 02:58:19,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:58:19,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:19,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:58:19,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:58:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:58:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:58:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:58:19,120 INFO L87 Difference]: Start difference. First operand 17417 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:42,356 INFO L93 Difference]: Finished difference Result 26125 states and 34057 transitions. [2022-04-08 02:58:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:58:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 02:58:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:58:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 02:58:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 02:58:42,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-08 02:58:42,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:58:51,276 INFO L225 Difference]: With dead ends: 26125 [2022-04-08 02:58:51,277 INFO L226 Difference]: Without dead ends: 17675 [2022-04-08 02:58:51,285 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-08 02:58:51,285 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:58:51,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:58:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-08 02:58:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-08 02:58:51,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:58:51,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:51,519 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:51,533 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:59:00,269 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-08 02:59:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-08 02:59:00,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:59:00,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:59:00,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 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 17675 states. [2022-04-08 02:59:00,348 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 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 17675 states. [2022-04-08 02:59:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:59:08,930 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-08 02:59:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-08 02:59:08,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:59:08,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:59:08,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:59:08,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:59:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 22791 transitions. [2022-04-08 02:59:17,972 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 22791 transitions. Word has length 32 [2022-04-08 02:59:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:59:17,972 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 22791 transitions. [2022-04-08 02:59:17,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 22791 transitions. [2022-04-08 02:59:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 02:59:17,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:59:17,981 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, 1, 1] [2022-04-08 02:59:17,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 02:59:17,982 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:59:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:59:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1693481623, now seen corresponding path program 1 times [2022-04-08 02:59:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:59:17,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583914450] [2022-04-08 02:59:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:59:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:59:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:59:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:59:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:59:18,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {457366#true} is VALID [2022-04-08 02:59:18,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {457366#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-08 02:59:18,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457366#true} {457366#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {457366#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:59:18,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {457372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {457366#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457366#true} {457366#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {457366#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {457366#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {457366#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {457366#true} is VALID [2022-04-08 02:59:18,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {457366#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {457366#true} [251] L78-->L78-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {457366#true} [253] L78-2-->L82-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {457366#true} [255] L82-1-->L86-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {457366#true} [257] L86-1-->L90-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {457366#true} [259] L90-1-->L94-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {457366#true} [261] L94-1-->L98-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {457366#true} [263] L98-1-->L102-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {457366#true} [265] L102-1-->L106-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {457366#true} [267] L106-1-->L110-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[] {457366#true} is VALID [2022-04-08 02:59:18,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {457366#true} [268] L110-1-->L114-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] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {457371#(= main_~lk10~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {457371#(= main_~lk10~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {457371#(= main_~lk10~0 1)} [275] L122-1-->L128-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {457371#(= main_~lk10~0 1)} [279] L128-1-->L133-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {457371#(= main_~lk10~0 1)} [285] L133-1-->L138-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {457371#(= main_~lk10~0 1)} [289] L138-1-->L143-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {457371#(= main_~lk10~0 1)} [293] L143-1-->L148-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {457371#(= main_~lk10~0 1)} [297] L148-1-->L153-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {457371#(= main_~lk10~0 1)} [301] L153-1-->L158-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {457371#(= main_~lk10~0 1)} [305] L158-1-->L163-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {457371#(= main_~lk10~0 1)} [309] L163-1-->L168-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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {457371#(= main_~lk10~0 1)} [312] L168-1-->L174: 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[] {457371#(= main_~lk10~0 1)} is VALID [2022-04-08 02:59:18,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {457371#(= main_~lk10~0 1)} [314] L174-->L184-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[] {457367#false} is VALID [2022-04-08 02:59:18,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {457367#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457367#false} is VALID [2022-04-08 02:59:18,016 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-08 02:59:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:59:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583914450] [2022-04-08 02:59:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583914450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:59:18,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:59:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:59:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626432625] [2022-04-08 02:59:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:59:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 02:59:18,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:59:18,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:18,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:59:18,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:59:18,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:59:18,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:59:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:59:18,036 INFO L87 Difference]: Start difference. First operand 17673 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:59:52,994 INFO L93 Difference]: Finished difference Result 29709 states and 38921 transitions. [2022-04-08 02:59:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:59:52,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 02:59:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:59:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 02:59:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:59:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 02:59:52,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-08 02:59:53,064 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-08 03:00:21,968 INFO L225 Difference]: With dead ends: 29709 [2022-04-08 03:00:21,969 INFO L226 Difference]: Without dead ends: 29707 [2022-04-08 03:00:21,972 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-08 03:00:21,972 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:00:21,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:00:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29707 states. [2022-04-08 03:00:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29707 to 26633. [2022-04-08 03:00:22,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:00:22,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:00:22,329 INFO L74 IsIncluded]: Start isIncluded. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:00:22,353 INFO L87 Difference]: Start difference. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:00:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:00:50,962 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-08 03:00:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-08 03:00:50,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:00:50,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:00:51,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 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 29707 states. [2022-04-08 03:00:51,026 INFO L87 Difference]: Start difference. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 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 29707 states. [2022-04-08 03:01:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:01:14,457 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-08 03:01:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-08 03:01:14,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:01:14,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:01:14,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:01:14,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:01:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26633 states to 26633 states and 33287 transitions. [2022-04-08 03:01:35,003 INFO L78 Accepts]: Start accepts. Automaton has 26633 states and 33287 transitions. Word has length 32 [2022-04-08 03:01:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:01:35,003 INFO L478 AbstractCegarLoop]: Abstraction has 26633 states and 33287 transitions. [2022-04-08 03:01:35,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 26633 states and 33287 transitions. [2022-04-08 03:01:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:01:35,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:01:35,020 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, 1, 1] [2022-04-08 03:01:35,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 03:01:35,020 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:01:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:01:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1093933864, now seen corresponding path program 1 times [2022-04-08 03:01:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:01:35,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183373228] [2022-04-08 03:01:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:01:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:01:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:01:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:01:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:01:35,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {574684#true} is VALID [2022-04-08 03:01:35,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {574684#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-08 03:01:35,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574684#true} {574684#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-08 03:01:35,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {574684#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {574690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {574684#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574684#true} {574684#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {574684#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {574684#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {574684#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {574684#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {574684#true} [251] L78-->L78-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[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {574684#true} [253] L78-2-->L82-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[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {574684#true} [255] L82-1-->L86-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[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {574684#true} [257] L86-1-->L90-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[] {574684#true} is VALID [2022-04-08 03:01:35,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {574684#true} [259] L90-1-->L94-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[] {574684#true} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {574684#true} [261] L94-1-->L98-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[] {574684#true} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {574684#true} [263] L98-1-->L102-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[] {574684#true} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {574684#true} [265] L102-1-->L106-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[] {574684#true} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {574684#true} [267] L106-1-->L110-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[] {574684#true} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {574684#true} [269] L110-1-->L114-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {574689#(= main_~p10~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {574689#(= main_~p10~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {574689#(= main_~p10~0 0)} [275] L122-1-->L128-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {574689#(= main_~p10~0 0)} [279] L128-1-->L133-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {574689#(= main_~p10~0 0)} [285] L133-1-->L138-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {574689#(= main_~p10~0 0)} [289] L138-1-->L143-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {574689#(= main_~p10~0 0)} [293] L143-1-->L148-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {574689#(= main_~p10~0 0)} [297] L148-1-->L153-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {574689#(= main_~p10~0 0)} [301] L153-1-->L158-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {574689#(= main_~p10~0 0)} [305] L158-1-->L163-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {574689#(= main_~p10~0 0)} [309] L163-1-->L168-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[] {574689#(= main_~p10~0 0)} is VALID [2022-04-08 03:01:35,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {574689#(= main_~p10~0 0)} [312] L168-1-->L174: 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[] {574685#false} is VALID [2022-04-08 03:01:35,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {574685#false} [314] L174-->L184-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[] {574685#false} is VALID [2022-04-08 03:01:35,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {574685#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574685#false} is VALID [2022-04-08 03:01:35,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-08 03:01:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:01:35,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183373228] [2022-04-08 03:01:35,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183373228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:01:35,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:01:35,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:01:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922118449] [2022-04-08 03:01:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:01:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 03:01:35,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:01:35,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:01:35,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:01:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 03:01:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:01:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:01:35,076 INFO L87 Difference]: Start difference. First operand 26633 states and 33287 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:06:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:06:11,957 INFO L93 Difference]: Finished difference Result 60429 states and 75273 transitions. [2022-04-08 03:06:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:06:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-08 03:06:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:06:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:06:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 03:06:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:06:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 03:06:11,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-08 03:06:12,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:06:44,919 INFO L225 Difference]: With dead ends: 60429 [2022-04-08 03:06:44,920 INFO L226 Difference]: Without dead ends: 34315 [2022-04-08 03:06:44,935 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-08 03:06:44,935 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:06:44,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:06:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-08 03:06:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-08 03:06:45,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:06:45,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:06:45,575 INFO L74 IsIncluded]: Start isIncluded. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:06:45,605 INFO L87 Difference]: Start difference. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:07:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:07:16,222 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-08 03:07:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-08 03:07:16,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:07:16,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:07:16,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 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 34315 states. [2022-04-08 03:07:16,307 INFO L87 Difference]: Start difference. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 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 34315 states. [2022-04-08 03:07:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:07:49,763 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-08 03:07:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-08 03:07:49,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:07:49,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:07:49,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:07:49,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:07:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:08:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 41991 transitions. [2022-04-08 03:08:30,953 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 41991 transitions. Word has length 32 [2022-04-08 03:08:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:08:30,953 INFO L478 AbstractCegarLoop]: Abstraction has 34313 states and 41991 transitions. [2022-04-08 03:08:30,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:08:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 41991 transitions. [2022-04-08 03:08:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 03:08:30,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:08:30,972 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, 1, 1, 1] [2022-04-08 03:08:30,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 03:08:30,973 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:08:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:08:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 958355932, now seen corresponding path program 1 times [2022-04-08 03:08:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:08:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378829936] [2022-04-08 03:08:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:08:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:08:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:08:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:08:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:08:31,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {740642#true} is VALID [2022-04-08 03:08:31,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {740642#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-08 03:08:31,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {740642#true} {740642#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {740642#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {740648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] 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] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {740642#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740642#true} {740642#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {740642#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {740642#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= 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~nondet14_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_~p5~0_1 |v_main_#t~nondet8_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~nondet14_2| v_main_~p11~0_1) (<= |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~nondet15_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) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~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_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~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_~lk12~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_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {740642#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {740642#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {740642#true} is VALID [2022-04-08 03:08:31,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {740642#true} [251] L78-->L78-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {740642#true} [253] L78-2-->L82-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {740642#true} [255] L82-1-->L86-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {740642#true} [257] L86-1-->L90-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {740642#true} [259] L90-1-->L94-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {740642#true} [261] L94-1-->L98-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {740642#true} [263] L98-1-->L102-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {740642#true} [265] L102-1-->L106-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {740642#true} [267] L106-1-->L110-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[] {740642#true} is VALID [2022-04-08 03:08:31,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {740642#true} [268] L110-1-->L114-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] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {740647#(not (= main_~p10~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {740647#(not (= main_~p10~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {740647#(not (= main_~p10~0 0))} [275] L122-1-->L128-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {740647#(not (= main_~p10~0 0))} [279] L128-1-->L133-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {740647#(not (= main_~p10~0 0))} [285] L133-1-->L138-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {740647#(not (= main_~p10~0 0))} [289] L138-1-->L143-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {740647#(not (= main_~p10~0 0))} [293] L143-1-->L148-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {740647#(not (= main_~p10~0 0))} [297] L148-1-->L153-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {740647#(not (= main_~p10~0 0))} [301] L153-1-->L158-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {740647#(not (= main_~p10~0 0))} [305] L158-1-->L163-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {740647#(not (= main_~p10~0 0))} [309] L163-1-->L168-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[] {740647#(not (= main_~p10~0 0))} is VALID [2022-04-08 03:08:31,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {740647#(not (= main_~p10~0 0))} [313] L168-1-->L173-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-08 03:08:31,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {740643#false} [316] L173-1-->L179: Formula: (not (= v_main_~p11~0_2 0)) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-08 03:08:31,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {740643#false} [318] L179-->L184-1: Formula: (not (= v_main_~lk11~0_3 1)) InVars {main_~lk11~0=v_main_~lk11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_3} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-08 03:08:31,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {740643#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {740643#false} is VALID [2022-04-08 03:08:31,019 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-08 03:08:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:08:31,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378829936] [2022-04-08 03:08:31,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378829936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:08:31,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:08:31,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:08:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12671256] [2022-04-08 03:08:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:08:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-08 03:08:31,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:08:31,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:08:31,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:08:31,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:08:31,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 03:08:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:08:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:08:31,037 INFO L87 Difference]: Start difference. First operand 34313 states and 41991 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)