/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:02:36,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:02:36,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:02:36,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:02:36,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:02:36,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:02:36,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:02:36,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:02:36,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:02:36,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:02:36,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:02:36,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:02:36,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:02:36,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:02:36,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:02:36,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:02:36,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:02:36,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:02:36,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:02:36,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:02:36,640 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:02:36,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:02:36,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:02:36,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:02:36,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:02:36,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:02:36,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:02:36,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:02:36,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:02:36,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:02:36,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:02:36,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:02:36,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:02:36,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:02:36,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:02:36,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:02:36,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:02:36,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:02:36,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:02:36,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:02:36,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:02:36,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:02:36,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 05:02:36,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:02:36,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:02:36,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 05:02:36,695 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 05:02:36,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 05:02:36,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 05:02:36,697 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 05:02:36,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:02:36,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:02:36,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:02:36,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:02:36,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 05:02:36,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 05:02:36,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:02:36,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 05:02:36,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 05:02:36,701 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 05:02:36,701 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:02:36,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:02:36,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:02:36,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:02:36,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:02:36,939 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:02:36,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-15 05:02:36,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22fd556c/46dddf84a6104a9aa275830736cba0ee/FLAG155c910db [2022-04-15 05:02:37,311 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:02:37,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-15 05:02:37,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22fd556c/46dddf84a6104a9aa275830736cba0ee/FLAG155c910db [2022-04-15 05:02:37,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22fd556c/46dddf84a6104a9aa275830736cba0ee [2022-04-15 05:02:37,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:02:37,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 05:02:37,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:02:37,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:02:37,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:02:37,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:02:37" (1/1) ... [2022-04-15 05:02:37,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16024cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:37, skipping insertion in model container [2022-04-15 05:02:37,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:02:37" (1/1) ... [2022-04-15 05:02:37,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:02:37,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:02:37,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-15 05:02:37,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:02:37,990 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:02:38,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-15 05:02:38,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:02:38,047 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:02:38,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38 WrapperNode [2022-04-15 05:02:38,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:02:38,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:02:38,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:02:38,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:02:38,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:02:38,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:02:38,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:02:38,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:02:38,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:02:38,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:02:38,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:02:38,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:02:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:02:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:02:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:02:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:02:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:02:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:02:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:02:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:02:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:02:38,217 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:02:38,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:02:38,397 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:02:38,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:02:38,408 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:02:38,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:38 BoogieIcfgContainer [2022-04-15 05:02:38,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:02:38,410 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 05:02:38,410 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 05:02:38,411 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 05:02:38,414 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:38" (1/1) ... [2022-04-15 05:02:38,415 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 05:02:38,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:02:38 BasicIcfg [2022-04-15 05:02:38,471 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 05:02:38,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:02:38,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:02:38,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:02:38,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:02:37" (1/4) ... [2022-04-15 05:02:38,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d33653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:02:38, skipping insertion in model container [2022-04-15 05:02:38,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:02:38" (2/4) ... [2022-04-15 05:02:38,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d33653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:02:38, skipping insertion in model container [2022-04-15 05:02:38,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:02:38" (3/4) ... [2022-04-15 05:02:38,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d33653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:02:38, skipping insertion in model container [2022-04-15 05:02:38,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 05:02:38" (4/4) ... [2022-04-15 05:02:38,480 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.cqvasr [2022-04-15 05:02:38,485 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:02:38,485 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:02:38,523 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:02:38,530 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:02:38,531 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:02:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:02:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:02:38,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:38,556 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:38,557 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -498315745, now seen corresponding path program 1 times [2022-04-15 05:02:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359348027] [2022-04-15 05:02:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:38,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:38,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-15 05:02:38,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 05:02:38,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 05:02:38,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:38,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-15 05:02:38,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 05:02:38,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 05:02:38,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-15 05:02:38,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {42#true} is VALID [2022-04-15 05:02:38,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {42#true} is VALID [2022-04-15 05:02:38,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {42#true} is VALID [2022-04-15 05:02:38,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} [198] L86-1-->L93: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {47#(= main_~lk1~0 1)} is VALID [2022-04-15 05:02:38,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 05:02:38,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-15 05:02:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:38,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359348027] [2022-04-15 05:02:38,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359348027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:38,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:38,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640131988] [2022-04-15 05:02:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:38,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:38,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:38,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:38,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:38,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:38,908 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,200 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-15 05:02:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:02:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 05:02:39,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 05:02:39,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:39,349 INFO L225 Difference]: With dead ends: 76 [2022-04-15 05:02:39,349 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 05:02:39,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:39,354 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:39,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:02:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 05:02:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-15 05:02:39,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:39,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,383 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,383 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,389 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-15 05:02:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-15 05:02:39,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:39,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:39,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 05:02:39,391 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 05:02:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,395 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-15 05:02:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-15 05:02:39,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:39,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:39,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:39,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-15 05:02:39,400 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-15 05:02:39,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:39,401 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-15 05:02:39,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-15 05:02:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:02:39,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:39,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:39,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:02:39,405 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1999700192, now seen corresponding path program 1 times [2022-04-15 05:02:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:39,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423504049] [2022-04-15 05:02:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:39,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {313#true} is VALID [2022-04-15 05:02:39,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-15 05:02:39,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-15 05:02:39,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:39,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {313#true} is VALID [2022-04-15 05:02:39,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-15 05:02:39,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-15 05:02:39,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-15 05:02:39,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {313#true} is VALID [2022-04-15 05:02:39,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {313#true} is VALID [2022-04-15 05:02:39,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {313#true} is VALID [2022-04-15 05:02:39,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(= main_~p1~0 0)} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(= main_~p1~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#(= main_~p1~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#(= main_~p1~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#(= main_~p1~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#(= main_~p1~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {318#(= main_~p1~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {318#(= main_~p1~0 0)} is VALID [2022-04-15 05:02:39,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {318#(= main_~p1~0 0)} [198] L86-1-->L93: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-15 05:02:39,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#false} [200] L93-->L128-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-15 05:02:39,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-15 05:02:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423504049] [2022-04-15 05:02:39,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423504049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:39,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:39,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626629928] [2022-04-15 05:02:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:39,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:39,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:39,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:39,516 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,783 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-15 05:02:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:02:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 05:02:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-15 05:02:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-15 05:02:39,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:39,955 INFO L225 Difference]: With dead ends: 98 [2022-04-15 05:02:39,955 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 05:02:39,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:39,962 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:39,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:02:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 05:02:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-15 05:02:39,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:39,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,979 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,979 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,985 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-15 05:02:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-15 05:02:39,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:39,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:39,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 05:02:39,988 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 05:02:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:39,991 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-15 05:02:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-15 05:02:39,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:39,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:39,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:39,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-15 05:02:39,994 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-15 05:02:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:39,995 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-15 05:02:39,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-15 05:02:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:39,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:39,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:39,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:02:40,000 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1732113068, now seen corresponding path program 1 times [2022-04-15 05:02:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:40,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309755855] [2022-04-15 05:02:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {621#true} is VALID [2022-04-15 05:02:40,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-15 05:02:40,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-15 05:02:40,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {621#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:40,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {621#true} is VALID [2022-04-15 05:02:40,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-15 05:02:40,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-15 05:02:40,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {621#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {621#true} is VALID [2022-04-15 05:02:40,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {621#true} is VALID [2022-04-15 05:02:40,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {621#true} is VALID [2022-04-15 05:02:40,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {621#true} is VALID [2022-04-15 05:02:40,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#true} [182] L58-->L58-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(not (= main_~p1~0 0))} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(not (= main_~p1~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(not (= main_~p1~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(not (= main_~p1~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(not (= main_~p1~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(not (= main_~p1~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#(not (= main_~p1~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {626#(not (= main_~p1~0 0))} is VALID [2022-04-15 05:02:40,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#(not (= main_~p1~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-15 05:02:40,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#false} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-15 05:02:40,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {622#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-15 05:02:40,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {622#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#false} is VALID [2022-04-15 05:02:40,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-15 05:02:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309755855] [2022-04-15 05:02:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309755855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:40,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:40,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141249027] [2022-04-15 05:02:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:40,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:40,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:40,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:40,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:40,119 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,272 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-15 05:02:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:02:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 05:02:40,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 05:02:40,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:40,401 INFO L225 Difference]: With dead ends: 91 [2022-04-15 05:02:40,401 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 05:02:40,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:40,402 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:40,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 05:02:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-15 05:02:40,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:40,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,408 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,409 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,411 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-15 05:02:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-15 05:02:40,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:40,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:40,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:02:40,412 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 05:02:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,417 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-15 05:02:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-15 05:02:40,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:40,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:40,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:40,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-15 05:02:40,421 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-15 05:02:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:40,421 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-15 05:02:40,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-15 05:02:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:40,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:40,422 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:40,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:02:40,423 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1861195787, now seen corresponding path program 1 times [2022-04-15 05:02:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:40,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797750523] [2022-04-15 05:02:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {933#true} is VALID [2022-04-15 05:02:40,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {933#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:40,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {933#true} is VALID [2022-04-15 05:02:40,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {933#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {933#true} is VALID [2022-04-15 05:02:40,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {933#true} is VALID [2022-04-15 05:02:40,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {933#true} is VALID [2022-04-15 05:02:40,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {933#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {933#true} is VALID [2022-04-15 05:02:40,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#(= main_~lk2~0 1)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(= main_~lk2~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(= main_~lk2~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(= main_~lk2~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#(= main_~lk2~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#(= main_~lk2~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(= main_~lk2~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {938#(= main_~lk2~0 1)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {938#(= main_~lk2~0 1)} is VALID [2022-04-15 05:02:40,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {938#(= main_~lk2~0 1)} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-15 05:02:40,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {934#false} is VALID [2022-04-15 05:02:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797750523] [2022-04-15 05:02:40,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797750523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:40,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:40,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846810085] [2022-04-15 05:02:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:40,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:40,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:40,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:40,535 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,681 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2022-04-15 05:02:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 05:02:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 05:02:40,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 05:02:40,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:40,770 INFO L225 Difference]: With dead ends: 113 [2022-04-15 05:02:40,770 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 05:02:40,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:40,771 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:40,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 05:02:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 81. [2022-04-15 05:02:40,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:40,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,778 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,779 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,782 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-15 05:02:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-15 05:02:40,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:40,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:40,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 05:02:40,784 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-15 05:02:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:40,788 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2022-04-15 05:02:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 190 transitions. [2022-04-15 05:02:40,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:40,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:40,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:40,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 77 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 137 transitions. [2022-04-15 05:02:40,792 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 137 transitions. Word has length 20 [2022-04-15 05:02:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:40,792 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 137 transitions. [2022-04-15 05:02:40,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 137 transitions. [2022-04-15 05:02:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:02:40,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:40,793 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:40,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:02:40,793 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash 64244428, now seen corresponding path program 1 times [2022-04-15 05:02:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:40,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766677317] [2022-04-15 05:02:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:40,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1381#true} is VALID [2022-04-15 05:02:40,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1381#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:40,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1381#true} is VALID [2022-04-15 05:02:40,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1381#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {1381#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1381#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1381#true} is VALID [2022-04-15 05:02:40,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {1381#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1381#true} is VALID [2022-04-15 05:02:40,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1381#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1381#true} is VALID [2022-04-15 05:02:40,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1381#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1381#true} is VALID [2022-04-15 05:02:40,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1381#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {1386#(= main_~p2~0 0)} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#(= main_~p2~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {1386#(= main_~p2~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {1386#(= main_~p2~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {1386#(= main_~p2~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(= main_~p2~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(= main_~p2~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1386#(= main_~p2~0 0)} is VALID [2022-04-15 05:02:40,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(= main_~p2~0 0)} [202] L92-1-->L98: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-15 05:02:40,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {1382#false} [206] L98-->L128-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-15 05:02:40,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1382#false} is VALID [2022-04-15 05:02:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:40,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766677317] [2022-04-15 05:02:40,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766677317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:40,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:40,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485452154] [2022-04-15 05:02:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:40,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:40,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:40,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:40,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:40,863 INFO L87 Difference]: Start difference. First operand 81 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,002 INFO L93 Difference]: Finished difference Result 185 states and 319 transitions. [2022-04-15 05:02:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:02:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-15 05:02:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-15 05:02:41,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-15 05:02:41,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,123 INFO L225 Difference]: With dead ends: 185 [2022-04-15 05:02:41,124 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 05:02:41,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:41,125 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:41,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 05:02:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-15 05:02:41,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:41,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,133 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,133 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,137 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-15 05:02:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-15 05:02:41,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 05:02:41,138 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 05:02:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,147 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2022-04-15 05:02:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 188 transitions. [2022-04-15 05:02:41,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:41,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-15 05:02:41,154 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-15 05:02:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:41,155 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-15 05:02:41,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-15 05:02:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:02:41,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:41,155 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:41,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 05:02:41,156 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1862526652, now seen corresponding path program 1 times [2022-04-15 05:02:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:41,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467487852] [2022-04-15 05:02:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1939#true} is VALID [2022-04-15 05:02:41,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:41,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {1945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1939#true} is VALID [2022-04-15 05:02:41,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1939#true} is VALID [2022-04-15 05:02:41,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {1939#true} is VALID [2022-04-15 05:02:41,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {1939#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {1939#true} is VALID [2022-04-15 05:02:41,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1939#true} is VALID [2022-04-15 05:02:41,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {1939#true} [184] L58-2-->L62-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {1944#(not (= main_~p2~0 0))} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {1944#(not (= main_~p2~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(not (= main_~p2~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(not (= main_~p2~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(not (= main_~p2~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#(not (= main_~p2~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(not (= main_~p2~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1944#(not (= main_~p2~0 0))} is VALID [2022-04-15 05:02:41,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(not (= main_~p2~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-15 05:02:41,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#false} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-15 05:02:41,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-15 05:02:41,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1940#false} is VALID [2022-04-15 05:02:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467487852] [2022-04-15 05:02:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467487852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:41,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:41,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350285462] [2022-04-15 05:02:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:41,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:41,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:41,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:41,237 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,376 INFO L93 Difference]: Finished difference Result 166 states and 278 transitions. [2022-04-15 05:02:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:41,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 05:02:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 05:02:41,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-15 05:02:41,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,496 INFO L225 Difference]: With dead ends: 166 [2022-04-15 05:02:41,496 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 05:02:41,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:41,498 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:41,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 05:02:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-04-15 05:02:41,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:41,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,516 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,516 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,520 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-15 05:02:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-15 05:02:41,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-15 05:02:41,521 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-15 05:02:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,524 INFO L93 Difference]: Finished difference Result 115 states and 188 transitions. [2022-04-15 05:02:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 188 transitions. [2022-04-15 05:02:41,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:41,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.688073394495413) internal successors, (184), 109 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 187 transitions. [2022-04-15 05:02:41,529 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 187 transitions. Word has length 21 [2022-04-15 05:02:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:41,530 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 187 transitions. [2022-04-15 05:02:41,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 187 transitions. [2022-04-15 05:02:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:02:41,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:41,530 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:41,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:02:41,531 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1991609371, now seen corresponding path program 1 times [2022-04-15 05:02:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320148679] [2022-04-15 05:02:41,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2484#true} is VALID [2022-04-15 05:02:41,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {2484#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:41,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {2490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2484#true} is VALID [2022-04-15 05:02:41,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {2484#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2484#true} {2484#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {2484#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {2484#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2484#true} is VALID [2022-04-15 05:02:41,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {2484#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {2484#true} is VALID [2022-04-15 05:02:41,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {2484#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {2484#true} is VALID [2022-04-15 05:02:41,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {2484#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {2484#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2484#true} is VALID [2022-04-15 05:02:41,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#(= main_~lk3~0 1)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#(= main_~lk3~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {2489#(= main_~lk3~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {2489#(= main_~lk3~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2489#(= main_~lk3~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {2489#(= main_~lk3~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {2489#(= main_~lk3~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2489#(= main_~lk3~0 1)} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2489#(= main_~lk3~0 1)} is VALID [2022-04-15 05:02:41,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2489#(= main_~lk3~0 1)} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-15 05:02:41,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {2485#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2485#false} is VALID [2022-04-15 05:02:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320148679] [2022-04-15 05:02:41,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320148679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:41,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:41,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:41,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472557722] [2022-04-15 05:02:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:41,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:41,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:41,604 INFO L87 Difference]: Start difference. First operand 113 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,744 INFO L93 Difference]: Finished difference Result 205 states and 345 transitions. [2022-04-15 05:02:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:02:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 05:02:41,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 05:02:41,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,825 INFO L225 Difference]: With dead ends: 205 [2022-04-15 05:02:41,825 INFO L226 Difference]: Without dead ends: 203 [2022-04-15 05:02:41,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:41,826 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:41,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-15 05:02:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 153. [2022-04-15 05:02:41,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:41,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,833 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,833 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,839 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-15 05:02:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-15 05:02:41,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-15 05:02:41,840 INFO L87 Difference]: Start difference. First operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-15 05:02:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:41,846 INFO L93 Difference]: Finished difference Result 203 states and 340 transitions. [2022-04-15 05:02:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 340 transitions. [2022-04-15 05:02:41,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:41,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:41,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:41,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.6644295302013423) internal successors, (248), 149 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 251 transitions. [2022-04-15 05:02:41,851 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 251 transitions. Word has length 21 [2022-04-15 05:02:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:41,851 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 251 transitions. [2022-04-15 05:02:41,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 251 transitions. [2022-04-15 05:02:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:02:41,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:41,852 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:41,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 05:02:41,853 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 194658012, now seen corresponding path program 1 times [2022-04-15 05:02:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:41,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919214476] [2022-04-15 05:02:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:41,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3286#true} is VALID [2022-04-15 05:02:41,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {3286#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:41,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {3292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3286#true} is VALID [2022-04-15 05:02:41,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {3286#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3286#true} {3286#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {3286#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {3286#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3286#true} is VALID [2022-04-15 05:02:41,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {3286#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {3286#true} is VALID [2022-04-15 05:02:41,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3286#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {3286#true} is VALID [2022-04-15 05:02:41,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3286#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {3286#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3286#true} is VALID [2022-04-15 05:02:41,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {3286#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {3291#(= main_~p3~0 0)} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {3291#(= main_~p3~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3291#(= main_~p3~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {3291#(= main_~p3~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(= main_~p3~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {3291#(= main_~p3~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {3291#(= main_~p3~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3291#(= main_~p3~0 0)} is VALID [2022-04-15 05:02:41,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {3291#(= main_~p3~0 0)} [208] L97-1-->L103: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-15 05:02:41,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {3287#false} [210] L103-->L128-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-15 05:02:41,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {3287#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3287#false} is VALID [2022-04-15 05:02:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:41,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919214476] [2022-04-15 05:02:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919214476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:41,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:41,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:41,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580016245] [2022-04-15 05:02:41,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:41,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:41,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:41,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:41,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:41,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:41,929 INFO L87 Difference]: Start difference. First operand 153 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,072 INFO L93 Difference]: Finished difference Result 353 states and 585 transitions. [2022-04-15 05:02:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:42,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:02:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-15 05:02:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-15 05:02:42,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-15 05:02:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,189 INFO L225 Difference]: With dead ends: 353 [2022-04-15 05:02:42,189 INFO L226 Difference]: Without dead ends: 211 [2022-04-15 05:02:42,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:42,190 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:42,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-15 05:02:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-04-15 05:02:42,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:42,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,197 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,198 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,203 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-15 05:02:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-15 05:02:42,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 05:02:42,206 INFO L87 Difference]: Start difference. First operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 211 states. [2022-04-15 05:02:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,211 INFO L93 Difference]: Finished difference Result 211 states and 340 transitions. [2022-04-15 05:02:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2022-04-15 05:02:42,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:42,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.6390243902439023) internal successors, (336), 205 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 339 transitions. [2022-04-15 05:02:42,216 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 339 transitions. Word has length 21 [2022-04-15 05:02:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:42,216 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 339 transitions. [2022-04-15 05:02:42,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 339 transitions. [2022-04-15 05:02:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:02:42,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:42,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:42,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 05:02:42,218 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1610380584, now seen corresponding path program 1 times [2022-04-15 05:02:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:42,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112996673] [2022-04-15 05:02:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4316#true} is VALID [2022-04-15 05:02:42,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:42,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {4322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4316#true} is VALID [2022-04-15 05:02:42,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4316#true} is VALID [2022-04-15 05:02:42,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {4316#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {4316#true} is VALID [2022-04-15 05:02:42,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {4316#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {4316#true} is VALID [2022-04-15 05:02:42,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {4316#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {4316#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4316#true} is VALID [2022-04-15 05:02:42,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {4316#true} [186] L62-1-->L66-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {4321#(not (= main_~p3~0 0))} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {4321#(not (= main_~p3~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {4321#(not (= main_~p3~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {4321#(not (= main_~p3~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {4321#(not (= main_~p3~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {4321#(not (= main_~p3~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {4321#(not (= main_~p3~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4321#(not (= main_~p3~0 0))} is VALID [2022-04-15 05:02:42,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {4321#(not (= main_~p3~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-15 05:02:42,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-15 05:02:42,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-15 05:02:42,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4317#false} is VALID [2022-04-15 05:02:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:42,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112996673] [2022-04-15 05:02:42,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112996673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:42,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:42,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135932753] [2022-04-15 05:02:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:42,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:42,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:42,276 INFO L87 Difference]: Start difference. First operand 209 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,413 INFO L93 Difference]: Finished difference Result 313 states and 505 transitions. [2022-04-15 05:02:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-15 05:02:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-15 05:02:42,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-15 05:02:42,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,522 INFO L225 Difference]: With dead ends: 313 [2022-04-15 05:02:42,522 INFO L226 Difference]: Without dead ends: 215 [2022-04-15 05:02:42,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:42,523 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:42,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-15 05:02:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-15 05:02:42,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:42,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,529 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,530 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,534 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-15 05:02:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-15 05:02:42,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-15 05:02:42,535 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-15 05:02:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,540 INFO L93 Difference]: Finished difference Result 215 states and 340 transitions. [2022-04-15 05:02:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2022-04-15 05:02:42,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:42,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 209 states have internal predecessors, (336), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2022-04-15 05:02:42,545 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 22 [2022-04-15 05:02:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:42,545 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2022-04-15 05:02:42,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2022-04-15 05:02:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:02:42,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:42,546 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:42,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 05:02:42,546 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1739463303, now seen corresponding path program 1 times [2022-04-15 05:02:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231684488] [2022-04-15 05:02:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5318#true} is VALID [2022-04-15 05:02:42,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {5318#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:42,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {5324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5318#true} is VALID [2022-04-15 05:02:42,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {5318#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5318#true} {5318#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {5318#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {5318#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {5318#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {5318#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {5318#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {5318#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {5318#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {5318#true} is VALID [2022-04-15 05:02:42,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {5318#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {5323#(= main_~lk4~0 1)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {5323#(= main_~lk4~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {5323#(= main_~lk4~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {5323#(= main_~lk4~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {5323#(= main_~lk4~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {5323#(= main_~lk4~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(= main_~lk4~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {5323#(= main_~lk4~0 1)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5323#(= main_~lk4~0 1)} is VALID [2022-04-15 05:02:42,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {5323#(= main_~lk4~0 1)} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-15 05:02:42,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5319#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5319#false} is VALID [2022-04-15 05:02:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:42,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231684488] [2022-04-15 05:02:42,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231684488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:42,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:42,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126232653] [2022-04-15 05:02:42,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:42,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:42,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:42,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:42,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:42,610 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,747 INFO L93 Difference]: Finished difference Result 381 states and 617 transitions. [2022-04-15 05:02:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 05:02:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-15 05:02:42,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-15 05:02:42,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,831 INFO L225 Difference]: With dead ends: 381 [2022-04-15 05:02:42,831 INFO L226 Difference]: Without dead ends: 379 [2022-04-15 05:02:42,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:42,832 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:42,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-15 05:02:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-15 05:02:42,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:42,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,840 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,841 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,849 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-15 05:02:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-15 05:02:42,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-15 05:02:42,851 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-15 05:02:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:42,860 INFO L93 Difference]: Finished difference Result 379 states and 608 transitions. [2022-04-15 05:02:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2022-04-15 05:02:42,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:42,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:42,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:42,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.5699658703071673) internal successors, (460), 293 states have internal predecessors, (460), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 463 transitions. [2022-04-15 05:02:42,868 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 463 transitions. Word has length 22 [2022-04-15 05:02:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:42,868 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 463 transitions. [2022-04-15 05:02:42,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 463 transitions. [2022-04-15 05:02:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:02:42,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:42,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:42,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 05:02:42,869 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash -57488056, now seen corresponding path program 1 times [2022-04-15 05:02:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:42,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880724574] [2022-04-15 05:02:42,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:42,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6804#true} is VALID [2022-04-15 05:02:42,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:42,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {6810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6804#true} is VALID [2022-04-15 05:02:42,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {6804#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {6804#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {6804#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {6804#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6804#true} is VALID [2022-04-15 05:02:42,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {6804#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#(= main_~p4~0 0)} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#(= main_~p4~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#(= main_~p4~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#(= main_~p4~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#(= main_~p4~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {6809#(= main_~p4~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {6809#(= main_~p4~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6809#(= main_~p4~0 0)} is VALID [2022-04-15 05:02:42,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {6809#(= main_~p4~0 0)} [212] L102-1-->L108: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-15 05:02:42,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {6805#false} [214] L108-->L128-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-15 05:02:42,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {6805#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6805#false} is VALID [2022-04-15 05:02:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:42,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880724574] [2022-04-15 05:02:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880724574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:42,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:42,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847183475] [2022-04-15 05:02:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:42,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:42,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:42,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:42,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:42,923 INFO L87 Difference]: Start difference. First operand 297 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,094 INFO L93 Difference]: Finished difference Result 685 states and 1073 transitions. [2022-04-15 05:02:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:02:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 05:02:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 05:02:43,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 05:02:43,214 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-15 05:02:43,224 INFO L225 Difference]: With dead ends: 685 [2022-04-15 05:02:43,224 INFO L226 Difference]: Without dead ends: 403 [2022-04-15 05:02:43,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:43,225 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:43,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-15 05:02:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-15 05:02:43,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:43,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,237 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,237 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,248 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-15 05:02:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-15 05:02:43,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:43,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:43,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-15 05:02:43,250 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-15 05:02:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,260 INFO L93 Difference]: Finished difference Result 403 states and 616 transitions. [2022-04-15 05:02:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2022-04-15 05:02:43,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:43,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:43,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:43,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5415617128463477) internal successors, (612), 397 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 615 transitions. [2022-04-15 05:02:43,272 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 615 transitions. Word has length 22 [2022-04-15 05:02:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:43,272 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 615 transitions. [2022-04-15 05:02:43,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 615 transitions. [2022-04-15 05:02:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:02:43,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:43,273 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:43,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 05:02:43,273 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1911180104, now seen corresponding path program 1 times [2022-04-15 05:02:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:43,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652996748] [2022-04-15 05:02:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:43,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8762#true} is VALID [2022-04-15 05:02:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {8762#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:43,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {8768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8762#true} is VALID [2022-04-15 05:02:43,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {8762#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8762#true} {8762#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {8762#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {8762#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {8762#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {8762#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {8762#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {8762#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {8762#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {8762#true} is VALID [2022-04-15 05:02:43,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {8762#true} [188] L66-1-->L70-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {8767#(not (= main_~p4~0 0))} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {8767#(not (= main_~p4~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {8767#(not (= main_~p4~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {8767#(not (= main_~p4~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {8767#(not (= main_~p4~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {8767#(not (= main_~p4~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {8767#(not (= main_~p4~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {8767#(not (= main_~p4~0 0))} is VALID [2022-04-15 05:02:43,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {8767#(not (= main_~p4~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-15 05:02:43,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {8763#false} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-15 05:02:43,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {8763#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-15 05:02:43,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {8763#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8763#false} is VALID [2022-04-15 05:02:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:43,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652996748] [2022-04-15 05:02:43,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652996748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:43,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:43,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563804132] [2022-04-15 05:02:43,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:43,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:43,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:43,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:43,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:43,334 INFO L87 Difference]: Start difference. First operand 401 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,488 INFO L93 Difference]: Finished difference Result 601 states and 917 transitions. [2022-04-15 05:02:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:43,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-15 05:02:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-15 05:02:43,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-15 05:02:43,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:43,600 INFO L225 Difference]: With dead ends: 601 [2022-04-15 05:02:43,600 INFO L226 Difference]: Without dead ends: 411 [2022-04-15 05:02:43,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:43,601 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:43,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-15 05:02:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-15 05:02:43,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:43,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,611 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,612 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,622 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-15 05:02:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-15 05:02:43,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:43,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:43,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-15 05:02:43,624 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-15 05:02:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,633 INFO L93 Difference]: Finished difference Result 411 states and 616 transitions. [2022-04-15 05:02:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2022-04-15 05:02:43,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:43,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:43,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:43,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.511111111111111) internal successors, (612), 405 states have internal predecessors, (612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 615 transitions. [2022-04-15 05:02:43,645 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 615 transitions. Word has length 23 [2022-04-15 05:02:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:43,645 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 615 transitions. [2022-04-15 05:02:43,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 615 transitions. [2022-04-15 05:02:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:02:43,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:43,648 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:43,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 05:02:43,648 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1782097385, now seen corresponding path program 1 times [2022-04-15 05:02:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:43,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618603601] [2022-04-15 05:02:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:43,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10660#true} is VALID [2022-04-15 05:02:43,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:43,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {10666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10660#true} is VALID [2022-04-15 05:02:43,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {10660#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {10660#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {10660#true} is VALID [2022-04-15 05:02:43,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {10660#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#(= main_~lk5~0 1)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#(= main_~lk5~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {10665#(= main_~lk5~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {10665#(= main_~lk5~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {10665#(= main_~lk5~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(= main_~lk5~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {10665#(= main_~lk5~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#(= main_~lk5~0 1)} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {10665#(= main_~lk5~0 1)} is VALID [2022-04-15 05:02:43,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#(= main_~lk5~0 1)} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-15 05:02:43,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10661#false} is VALID [2022-04-15 05:02:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:43,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618603601] [2022-04-15 05:02:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618603601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:43,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:43,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52530780] [2022-04-15 05:02:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:43,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:43,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:43,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:43,706 INFO L87 Difference]: Start difference. First operand 409 states and 615 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:43,881 INFO L93 Difference]: Finished difference Result 717 states and 1097 transitions. [2022-04-15 05:02:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 05:02:43,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 05:02:43,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:43,978 INFO L225 Difference]: With dead ends: 717 [2022-04-15 05:02:43,979 INFO L226 Difference]: Without dead ends: 715 [2022-04-15 05:02:43,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:43,980 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:43,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-15 05:02:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-15 05:02:43,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:43,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,994 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:43,995 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,020 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-15 05:02:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-15 05:02:44,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:44,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:44,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 05:02:44,023 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-15 05:02:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,048 INFO L93 Difference]: Finished difference Result 715 states and 1080 transitions. [2022-04-15 05:02:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1080 transitions. [2022-04-15 05:02:44,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:44,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:44,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:44,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.4664371772805507) internal successors, (852), 581 states have internal predecessors, (852), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 855 transitions. [2022-04-15 05:02:44,069 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 855 transitions. Word has length 23 [2022-04-15 05:02:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:44,069 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 855 transitions. [2022-04-15 05:02:44,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 855 transitions. [2022-04-15 05:02:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:02:44,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:44,071 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:44,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 05:02:44,071 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 715918552, now seen corresponding path program 1 times [2022-04-15 05:02:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995894742] [2022-04-15 05:02:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:44,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13466#true} is VALID [2022-04-15 05:02:44,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {13466#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:44,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {13472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13466#true} is VALID [2022-04-15 05:02:44,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {13466#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13466#true} {13466#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {13466#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {13466#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {13466#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {13466#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {13466#true} is VALID [2022-04-15 05:02:44,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {13466#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {13466#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {13466#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {13466#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {13466#true} is VALID [2022-04-15 05:02:44,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {13466#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {13471#(= main_~p5~0 0)} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {13471#(= main_~p5~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {13471#(= main_~p5~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {13471#(= main_~p5~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {13471#(= main_~p5~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {13471#(= main_~p5~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {13471#(= main_~p5~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {13471#(= main_~p5~0 0)} is VALID [2022-04-15 05:02:44,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {13471#(= main_~p5~0 0)} [216] L107-1-->L113: Formula: (not (= v_main_~p5~0_4 0)) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-15 05:02:44,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {13467#false} [218] L113-->L128-1: Formula: (not (= v_main_~lk5~0_4 1)) InVars {main_~lk5~0=v_main_~lk5~0_4} OutVars{main_~lk5~0=v_main_~lk5~0_4} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-15 05:02:44,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {13467#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13467#false} is VALID [2022-04-15 05:02:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995894742] [2022-04-15 05:02:44,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995894742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:44,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:44,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189465936] [2022-04-15 05:02:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:44,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:44,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:44,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:44,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:44,139 INFO L87 Difference]: Start difference. First operand 585 states and 855 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,339 INFO L93 Difference]: Finished difference Result 1341 states and 1961 transitions. [2022-04-15 05:02:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:02:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 05:02:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-15 05:02:44,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-15 05:02:44,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:44,470 INFO L225 Difference]: With dead ends: 1341 [2022-04-15 05:02:44,471 INFO L226 Difference]: Without dead ends: 779 [2022-04-15 05:02:44,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:44,472 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:44,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-15 05:02:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-15 05:02:44,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:44,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,491 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,492 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,521 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-15 05:02:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-15 05:02:44,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:44,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-15 05:02:44,525 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-15 05:02:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,555 INFO L93 Difference]: Finished difference Result 779 states and 1112 transitions. [2022-04-15 05:02:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1112 transitions. [2022-04-15 05:02:44,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:44,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:44,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:44,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4333764553686934) internal successors, (1108), 773 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1111 transitions. [2022-04-15 05:02:44,587 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1111 transitions. Word has length 23 [2022-04-15 05:02:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:44,587 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1111 transitions. [2022-04-15 05:02:44,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1111 transitions. [2022-04-15 05:02:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:02:44,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:44,589 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:44,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 05:02:44,589 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash 589588388, now seen corresponding path program 1 times [2022-04-15 05:02:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:44,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481320799] [2022-04-15 05:02:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:44,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17248#true} is VALID [2022-04-15 05:02:44,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {17248#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:44,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {17254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17248#true} is VALID [2022-04-15 05:02:44,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {17248#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17248#true} {17248#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {17248#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {17248#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {17248#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {17248#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {17248#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {17248#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {17248#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {17248#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {17248#true} is VALID [2022-04-15 05:02:44,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {17248#true} [190] L70-1-->L74-1: Formula: (and (= v_main_~lk5~0_3 1) (not (= v_main_~p5~0_2 0))) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {17253#(not (= main_~p5~0 0))} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {17253#(not (= main_~p5~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {17253#(not (= main_~p5~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {17253#(not (= main_~p5~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {17253#(not (= main_~p5~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {17253#(not (= main_~p5~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {17253#(not (= main_~p5~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {17253#(not (= main_~p5~0 0))} is VALID [2022-04-15 05:02:44,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {17253#(not (= main_~p5~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-15 05:02:44,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {17249#false} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-15 05:02:44,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {17249#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-15 05:02:44,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {17249#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17249#false} is VALID [2022-04-15 05:02:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:44,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481320799] [2022-04-15 05:02:44,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481320799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:44,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:44,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437182156] [2022-04-15 05:02:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:44,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:44,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:44,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:44,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:44,642 INFO L87 Difference]: Start difference. First operand 777 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:44,832 INFO L93 Difference]: Finished difference Result 1165 states and 1657 transitions. [2022-04-15 05:02:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 05:02:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 05:02:44,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 05:02:44,943 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-15 05:02:44,975 INFO L225 Difference]: With dead ends: 1165 [2022-04-15 05:02:44,975 INFO L226 Difference]: Without dead ends: 795 [2022-04-15 05:02:44,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:44,978 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:44,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-15 05:02:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-15 05:02:44,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:44,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:44,999 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,000 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:45,030 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-15 05:02:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-15 05:02:45,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:45,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:45,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-15 05:02:45,034 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-15 05:02:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:45,063 INFO L93 Difference]: Finished difference Result 795 states and 1112 transitions. [2022-04-15 05:02:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1112 transitions. [2022-04-15 05:02:45,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:45,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:45,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:45,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4043092522179974) internal successors, (1108), 789 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1111 transitions. [2022-04-15 05:02:45,095 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1111 transitions. Word has length 24 [2022-04-15 05:02:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:45,095 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1111 transitions. [2022-04-15 05:02:45,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1111 transitions. [2022-04-15 05:02:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:02:45,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:45,097 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:45,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 05:02:45,097 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 718671107, now seen corresponding path program 1 times [2022-04-15 05:02:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657974955] [2022-04-15 05:02:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:45,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {20902#true} is VALID [2022-04-15 05:02:45,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {20902#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:45,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {20908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {20902#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20902#true} {20902#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {20902#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {20902#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {20902#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {20902#true} is VALID [2022-04-15 05:02:45,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {20902#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {20902#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {20902#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {20902#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {20902#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {20902#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {20902#true} is VALID [2022-04-15 05:02:45,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {20902#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {20907#(= main_~lk6~0 1)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {20907#(= main_~lk6~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {20907#(= main_~lk6~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {20907#(= main_~lk6~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {20907#(= main_~lk6~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {20907#(= main_~lk6~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {20907#(= main_~lk6~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {20907#(= main_~lk6~0 1)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {20907#(= main_~lk6~0 1)} is VALID [2022-04-15 05:02:45,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {20907#(= main_~lk6~0 1)} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-15 05:02:45,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {20903#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20903#false} is VALID [2022-04-15 05:02:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:45,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:45,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657974955] [2022-04-15 05:02:45,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657974955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:45,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:45,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423176372] [2022-04-15 05:02:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:45,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:45,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:45,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:45,149 INFO L87 Difference]: Start difference. First operand 793 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:45,364 INFO L93 Difference]: Finished difference Result 1357 states and 1929 transitions. [2022-04-15 05:02:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 05:02:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 05:02:45,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-15 05:02:45,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:45,510 INFO L225 Difference]: With dead ends: 1357 [2022-04-15 05:02:45,510 INFO L226 Difference]: Without dead ends: 1355 [2022-04-15 05:02:45,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:45,512 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:45,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-15 05:02:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-15 05:02:45,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:45,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,537 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,538 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:45,612 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-15 05:02:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-15 05:02:45,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:45,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:45,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-15 05:02:45,617 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-15 05:02:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:45,692 INFO L93 Difference]: Finished difference Result 1355 states and 1896 transitions. [2022-04-15 05:02:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1896 transitions. [2022-04-15 05:02:45,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:45,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:45,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:45,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.3586862575626621) internal successors, (1572), 1157 states have internal predecessors, (1572), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1575 transitions. [2022-04-15 05:02:45,756 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1575 transitions. Word has length 24 [2022-04-15 05:02:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:45,757 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1575 transitions. [2022-04-15 05:02:45,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1575 transitions. [2022-04-15 05:02:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:02:45,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:45,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:45,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 05:02:45,759 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1078280252, now seen corresponding path program 1 times [2022-04-15 05:02:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:45,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905592003] [2022-04-15 05:02:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:45,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26252#true} is VALID [2022-04-15 05:02:45,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {26252#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {26258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {26252#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26252#true} {26252#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {26252#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {26252#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {26252#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {26252#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {26252#true} is VALID [2022-04-15 05:02:45,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {26252#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {26252#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {26252#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {26252#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {26252#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {26252#true} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {26252#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {26257#(= main_~p6~0 0)} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {26257#(= main_~p6~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {26257#(= main_~p6~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {26257#(= main_~p6~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {26257#(= main_~p6~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {26257#(= main_~p6~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {26257#(= main_~p6~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {26257#(= main_~p6~0 0)} is VALID [2022-04-15 05:02:45,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {26257#(= main_~p6~0 0)} [220] L112-1-->L118: Formula: (not (= v_main_~p6~0_5 0)) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-15 05:02:45,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {26253#false} [222] L118-->L128-1: Formula: (not (= v_main_~lk6~0_1 1)) InVars {main_~lk6~0=v_main_~lk6~0_1} OutVars{main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-15 05:02:45,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {26253#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26253#false} is VALID [2022-04-15 05:02:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:45,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905592003] [2022-04-15 05:02:45,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905592003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:45,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:45,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64665599] [2022-04-15 05:02:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:45,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:45,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:45,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:45,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:45,818 INFO L87 Difference]: Start difference. First operand 1161 states and 1575 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:46,229 INFO L93 Difference]: Finished difference Result 2637 states and 3561 transitions. [2022-04-15 05:02:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:02:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 05:02:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-15 05:02:46,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-15 05:02:46,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:46,442 INFO L225 Difference]: With dead ends: 2637 [2022-04-15 05:02:46,443 INFO L226 Difference]: Without dead ends: 1515 [2022-04-15 05:02:46,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:46,446 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:46,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-15 05:02:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-15 05:02:46,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:46,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,490 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,491 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:46,579 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-15 05:02:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-15 05:02:46,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:46,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:46,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-15 05:02:46,585 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-15 05:02:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:46,672 INFO L93 Difference]: Finished difference Result 1515 states and 1992 transitions. [2022-04-15 05:02:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1992 transitions. [2022-04-15 05:02:46,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:46,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:46,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:46,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.317428760768721) internal successors, (1988), 1509 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1991 transitions. [2022-04-15 05:02:46,775 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1991 transitions. Word has length 24 [2022-04-15 05:02:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:46,775 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 1991 transitions. [2022-04-15 05:02:46,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1991 transitions. [2022-04-15 05:02:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:02:46,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:46,777 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:46,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 05:02:46,778 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 804000436, now seen corresponding path program 1 times [2022-04-15 05:02:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700417901] [2022-04-15 05:02:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:46,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33618#true} is VALID [2022-04-15 05:02:46,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {33618#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:46,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33618#true} is VALID [2022-04-15 05:02:46,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {33618#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33618#true} {33618#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {33618#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {33618#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {33618#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {33618#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {33618#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {33618#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {33618#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {33618#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {33618#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {33618#true} is VALID [2022-04-15 05:02:46,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {33618#true} [192] L74-1-->L78-1: Formula: (and (= v_main_~lk6~0_6 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {33623#(not (= main_~p6~0 0))} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {33623#(not (= main_~p6~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {33623#(not (= main_~p6~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {33623#(not (= main_~p6~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {33623#(not (= main_~p6~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {33623#(not (= main_~p6~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {33623#(not (= main_~p6~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {33623#(not (= main_~p6~0 0))} is VALID [2022-04-15 05:02:46,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {33623#(not (= main_~p6~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-15 05:02:46,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {33619#false} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-15 05:02:46,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {33619#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-15 05:02:46,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {33619#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33619#false} is VALID [2022-04-15 05:02:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:46,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700417901] [2022-04-15 05:02:46,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700417901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:46,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:46,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212611435] [2022-04-15 05:02:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:46,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:46,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:46,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:46,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:46,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:46,831 INFO L87 Difference]: Start difference. First operand 1513 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:47,182 INFO L93 Difference]: Finished difference Result 2269 states and 2969 transitions. [2022-04-15 05:02:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 05:02:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 05:02:47,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-15 05:02:47,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:47,387 INFO L225 Difference]: With dead ends: 2269 [2022-04-15 05:02:47,387 INFO L226 Difference]: Without dead ends: 1547 [2022-04-15 05:02:47,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:47,390 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:47,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-15 05:02:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-15 05:02:47,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:47,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,429 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:47,510 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-15 05:02:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-15 05:02:47,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:47,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:47,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-15 05:02:47,517 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-15 05:02:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:47,611 INFO L93 Difference]: Finished difference Result 1547 states and 1992 transitions. [2022-04-15 05:02:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1992 transitions. [2022-04-15 05:02:47,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:47,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:47,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:47,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.2900713822193381) internal successors, (1988), 1541 states have internal predecessors, (1988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1991 transitions. [2022-04-15 05:02:47,702 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1991 transitions. Word has length 25 [2022-04-15 05:02:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:47,702 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1991 transitions. [2022-04-15 05:02:47,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1991 transitions. [2022-04-15 05:02:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:02:47,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:47,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:47,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 05:02:47,704 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 933083155, now seen corresponding path program 1 times [2022-04-15 05:02:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:47,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091877845] [2022-04-15 05:02:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:47,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40712#true} is VALID [2022-04-15 05:02:47,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {40712#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {40718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {40712#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40712#true} {40712#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {40712#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {40712#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {40712#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {40712#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {40712#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {40712#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {40712#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {40712#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {40712#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {40712#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {40712#true} is VALID [2022-04-15 05:02:47,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {40712#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {40717#(= main_~lk7~0 1)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {40717#(= main_~lk7~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {40717#(= main_~lk7~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {40717#(= main_~lk7~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {40717#(= main_~lk7~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {40717#(= main_~lk7~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {40717#(= main_~lk7~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {40717#(= main_~lk7~0 1)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {40717#(= main_~lk7~0 1)} is VALID [2022-04-15 05:02:47,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {40717#(= main_~lk7~0 1)} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-15 05:02:47,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {40713#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40713#false} is VALID [2022-04-15 05:02:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091877845] [2022-04-15 05:02:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091877845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:47,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974572512] [2022-04-15 05:02:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:47,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:47,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:47,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:47,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:47,755 INFO L87 Difference]: Start difference. First operand 1545 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:48,125 INFO L93 Difference]: Finished difference Result 2573 states and 3337 transitions. [2022-04-15 05:02:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 05:02:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 05:02:48,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-15 05:02:48,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:48,370 INFO L225 Difference]: With dead ends: 2573 [2022-04-15 05:02:48,370 INFO L226 Difference]: Without dead ends: 2571 [2022-04-15 05:02:48,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:48,372 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:48,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-15 05:02:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-15 05:02:48,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:48,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,430 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,432 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:48,607 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-15 05:02:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-15 05:02:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:48,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-15 05:02:48,615 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-15 05:02:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:48,846 INFO L93 Difference]: Finished difference Result 2571 states and 3272 transitions. [2022-04-15 05:02:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3272 transitions. [2022-04-15 05:02:48,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:48,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:48,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:48,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2490255521870939) internal successors, (2884), 2309 states have internal predecessors, (2884), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2887 transitions. [2022-04-15 05:02:49,060 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2887 transitions. Word has length 25 [2022-04-15 05:02:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:49,060 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2887 transitions. [2022-04-15 05:02:49,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2887 transitions. [2022-04-15 05:02:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:02:49,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:49,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:49,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 05:02:49,063 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash -863868204, now seen corresponding path program 1 times [2022-04-15 05:02:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490863569] [2022-04-15 05:02:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:49,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {50958#true} is VALID [2022-04-15 05:02:49,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {50958#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:49,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {50964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {50958#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50958#true} {50958#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {50958#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {50958#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {50958#true} is VALID [2022-04-15 05:02:49,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {50958#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {50958#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {50958#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {50958#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {50958#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {50958#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {50958#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {50958#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {50958#true} is VALID [2022-04-15 05:02:49,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {50958#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {50963#(= main_~p7~0 0)} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {50963#(= main_~p7~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {50963#(= main_~p7~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {50963#(= main_~p7~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {50963#(= main_~p7~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {50963#(= main_~p7~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {50963#(= main_~p7~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {50963#(= main_~p7~0 0)} is VALID [2022-04-15 05:02:49,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {50963#(= main_~p7~0 0)} [224] L117-1-->L123: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-15 05:02:49,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {50959#false} [226] L123-->L128-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-15 05:02:49,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {50959#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50959#false} is VALID [2022-04-15 05:02:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:49,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490863569] [2022-04-15 05:02:49,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490863569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:49,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:49,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184574280] [2022-04-15 05:02:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:49,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:49,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:49,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:49,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:49,116 INFO L87 Difference]: Start difference. First operand 2313 states and 2887 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:50,146 INFO L93 Difference]: Finished difference Result 5197 states and 6409 transitions. [2022-04-15 05:02:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:50,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 05:02:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 05:02:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 05:02:50,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-15 05:02:50,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:50,474 INFO L225 Difference]: With dead ends: 5197 [2022-04-15 05:02:50,474 INFO L226 Difference]: Without dead ends: 2955 [2022-04-15 05:02:50,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:50,479 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:50,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-15 05:02:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-15 05:02:50,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:50,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,578 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,581 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:50,846 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-15 05:02:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-15 05:02:50,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:50,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:50,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-15 05:02:50,856 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-15 05:02:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:51,148 INFO L93 Difference]: Finished difference Result 2955 states and 3528 transitions. [2022-04-15 05:02:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3528 transitions. [2022-04-15 05:02:51,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:51,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:51,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:51,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.1949813496100372) internal successors, (3524), 2949 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3527 transitions. [2022-04-15 05:02:51,515 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3527 transitions. Word has length 25 [2022-04-15 05:02:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:51,515 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3527 transitions. [2022-04-15 05:02:51,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3527 transitions. [2022-04-15 05:02:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:02:51,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:51,518 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:51,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 05:02:51,519 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1139160544, now seen corresponding path program 1 times [2022-04-15 05:02:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:51,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799029599] [2022-04-15 05:02:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:51,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {65364#true} is VALID [2022-04-15 05:02:51,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {65364#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:51,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {65370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {65364#true} is VALID [2022-04-15 05:02:51,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {65364#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65364#true} {65364#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {65364#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {65364#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {65364#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {65364#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {65364#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {65364#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {65364#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {65364#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {65364#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {65364#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {65364#true} is VALID [2022-04-15 05:02:51,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {65364#true} [194] L78-1-->L82-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {65369#(not (= main_~p7~0 0))} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {65369#(not (= main_~p7~0 0))} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {65369#(not (= main_~p7~0 0))} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {65369#(not (= main_~p7~0 0))} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {65369#(not (= main_~p7~0 0))} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {65369#(not (= main_~p7~0 0))} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {65369#(not (= main_~p7~0 0))} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {65369#(not (= main_~p7~0 0))} is VALID [2022-04-15 05:02:51,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {65369#(not (= main_~p7~0 0))} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-15 05:02:51,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {65365#false} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-15 05:02:51,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {65365#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-15 05:02:51,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {65365#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65365#false} is VALID [2022-04-15 05:02:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:51,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799029599] [2022-04-15 05:02:51,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799029599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:51,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:51,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22317276] [2022-04-15 05:02:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:51,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:51,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:51,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:51,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:51,588 INFO L87 Difference]: Start difference. First operand 2953 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:52,397 INFO L93 Difference]: Finished difference Result 4429 states and 5257 transitions. [2022-04-15 05:02:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 05:02:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 05:02:52,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-15 05:02:52,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:52,746 INFO L225 Difference]: With dead ends: 4429 [2022-04-15 05:02:52,746 INFO L226 Difference]: Without dead ends: 3019 [2022-04-15 05:02:52,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:52,748 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:52,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-15 05:02:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-15 05:02:52,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:52,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:52,809 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:52,811 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:53,036 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-15 05:02:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-15 05:02:53,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:53,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:53,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-15 05:02:53,045 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-15 05:02:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:53,285 INFO L93 Difference]: Finished difference Result 3019 states and 3528 transitions. [2022-04-15 05:02:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3528 transitions. [2022-04-15 05:02:53,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:53,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:53,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:53,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.1695984069034184) internal successors, (3524), 3013 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3527 transitions. [2022-04-15 05:02:53,530 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3527 transitions. Word has length 26 [2022-04-15 05:02:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:53,530 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3527 transitions. [2022-04-15 05:02:53,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3527 transitions. [2022-04-15 05:02:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:02:53,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:53,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:53,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 05:02:53,532 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1010077825, now seen corresponding path program 1 times [2022-04-15 05:02:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912764892] [2022-04-15 05:02:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:53,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {79194#true} is VALID [2022-04-15 05:02:53,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {79194#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:53,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {79200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {79194#true} is VALID [2022-04-15 05:02:53,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {79194#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79194#true} {79194#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {79194#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {79194#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {79194#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {79194#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {79194#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {79194#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {79194#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {79194#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {79194#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {79194#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {79194#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {79194#true} is VALID [2022-04-15 05:02:53,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {79194#true} [196] L82-1-->L86-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {79199#(= main_~lk8~0 1)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {79199#(= main_~lk8~0 1)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {79199#(= main_~lk8~0 1)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {79199#(= main_~lk8~0 1)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {79199#(= main_~lk8~0 1)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {79199#(= main_~lk8~0 1)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {79199#(= main_~lk8~0 1)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {79199#(= main_~lk8~0 1)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {79199#(= main_~lk8~0 1)} is VALID [2022-04-15 05:02:53,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {79199#(= main_~lk8~0 1)} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-15 05:02:53,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {79195#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79195#false} is VALID [2022-04-15 05:02:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912764892] [2022-04-15 05:02:53,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912764892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:53,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:53,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209804322] [2022-04-15 05:02:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:53,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:53,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:53,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:53,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:53,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:53,585 INFO L87 Difference]: Start difference. First operand 3017 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:54,385 INFO L93 Difference]: Finished difference Result 4875 states and 5640 transitions. [2022-04-15 05:02:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 05:02:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 05:02:54,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-15 05:02:54,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:55,155 INFO L225 Difference]: With dead ends: 4875 [2022-04-15 05:02:55,155 INFO L226 Difference]: Without dead ends: 4873 [2022-04-15 05:02:55,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:02:55,156 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:02:55,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:02:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-15 05:02:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-15 05:02:55,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:02:55,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:55,241 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:55,244 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:55,870 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-15 05:02:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-15 05:02:55,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:55,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:55,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-15 05:02:55,883 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-15 05:02:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:56,512 INFO L93 Difference]: Finished difference Result 4873 states and 5511 transitions. [2022-04-15 05:02:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5511 transitions. [2022-04-15 05:02:56,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:02:56,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:02:56,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:02:56,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:02:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1385215694775634) internal successors, (5252), 4613 states have internal predecessors, (5252), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5255 transitions. [2022-04-15 05:02:57,058 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5255 transitions. Word has length 26 [2022-04-15 05:02:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:02:57,058 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5255 transitions. [2022-04-15 05:02:57,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5255 transitions. [2022-04-15 05:02:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:02:57,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:02:57,063 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:02:57,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 05:02:57,063 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:02:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:02:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1487938112, now seen corresponding path program 1 times [2022-04-15 05:02:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:02:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861599826] [2022-04-15 05:02:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:02:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:02:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:02:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:02:57,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98841#true} is VALID [2022-04-15 05:02:57,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {98841#true} [169] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:02:57,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {98847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [171] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {98841#true} [174] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98841#true} {98841#true} [232] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {98841#true} [170] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {98841#true} [173] mainENTRY-->L127-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_4, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~lk3~0, main_~p8~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {98841#true} [177] L127-1-->L37: Formula: (and (= |v_main_#t~nondet12_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet12, main_~cond~0] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {98841#true} [180] L37-->L58: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_5, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk8~0, main_~lk7~0] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {98841#true} [183] L58-->L58-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {98841#true} [185] L58-2-->L62-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {98841#true} [187] L62-1-->L66-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {98841#true} [189] L66-1-->L70-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {98841#true} [191] L70-1-->L74-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {98841#true} [193] L74-1-->L78-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {98841#true} [195] L78-1-->L82-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {98841#true} is VALID [2022-04-15 05:02:57,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {98841#true} [197] L82-1-->L86-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {98846#(= main_~p8~0 0)} [199] L86-1-->L92-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {98846#(= main_~p8~0 0)} [203] L92-1-->L97-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {98846#(= main_~p8~0 0)} [209] L97-1-->L102-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {98846#(= main_~p8~0 0)} [213] L102-1-->L107-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {98846#(= main_~p8~0 0)} [217] L107-1-->L112-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {98846#(= main_~p8~0 0)} [221] L112-1-->L117-1: Formula: (= v_main_~p6~0_1 0) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {98846#(= main_~p8~0 0)} [225] L117-1-->L122-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {98846#(= main_~p8~0 0)} is VALID [2022-04-15 05:02:57,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {98846#(= main_~p8~0 0)} [228] L122-1-->L128: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-15 05:02:57,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {98842#false} [230] L128-->L128-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-15 05:02:57,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {98842#false} [204] L128-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98842#false} is VALID [2022-04-15 05:02:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:02:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:02:57,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861599826] [2022-04-15 05:02:57,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861599826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:02:57,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:02:57,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:02:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636851160] [2022-04-15 05:02:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:02:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:57,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:02:57,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:57,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:02:57,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:02:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 05:02:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:02:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:02:57,128 INFO L87 Difference]: Start difference. First operand 4617 states and 5255 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:02:59,961 INFO L93 Difference]: Finished difference Result 10249 states and 11399 transitions. [2022-04-15 05:02:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:02:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 05:02:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:02:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 05:02:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:02:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 05:02:59,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-15 05:03:00,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:03:00,062 INFO L225 Difference]: With dead ends: 10249 [2022-04-15 05:03:00,062 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:03:00,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:03:00,072 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:03:00,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:03:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:03:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:03:00,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:03:00,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:03:00,073 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:03:00,073 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:03:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:00,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:03:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:03:00,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:00,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:00,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:03:00,074 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:03:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:03:00,074 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:03:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:03:00,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:00,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:03:00,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:03:00,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:03:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:03:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:03:00,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-15 05:03:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:03:00,075 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:03:00,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:03:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:03:00,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:03:00,077 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:03:00,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 05:03:00,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:03:11,671 WARN L232 SmtUtils]: Spent 11.58s on a formula simplification that was a NOOP. DAG size: 1070 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 05:03:11,699 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:03:11,700 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-15 05:03:11,700 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-15 05:03:11,700 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 137) no Hoare annotation was computed. [2022-04-15 05:03:11,700 INFO L882 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-04-15 05:03:11,701 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 137) no Hoare annotation was computed. [2022-04-15 05:03:11,701 INFO L882 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,701 INFO L882 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,701 INFO L882 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,701 INFO L882 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-04-15 05:03:11,702 INFO L882 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-04-15 05:03:11,703 INFO L882 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-04-15 05:03:11,706 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:03:11,707 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:03:11,710 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:03:11,710 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-15 05:03:11,711 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 05:03:11,712 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-15 05:03:11,713 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-15 05:03:11,714 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-15 05:03:11,714 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:03:11,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:03:11 BasicIcfg [2022-04-15 05:03:11,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:03:11,720 INFO L158 Benchmark]: Toolchain (without parser) took 33979.74ms. Allocated memory was 195.0MB in the beginning and 468.7MB in the end (delta: 273.7MB). Free memory was 136.2MB in the beginning and 271.2MB in the end (delta: -135.0MB). Peak memory consumption was 264.8MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,720 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:03:11,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.96ms. Allocated memory was 195.0MB in the beginning and 270.5MB in the end (delta: 75.5MB). Free memory was 136.0MB in the beginning and 240.4MB in the end (delta: -104.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,721 INFO L158 Benchmark]: Boogie Preprocessor took 43.93ms. Allocated memory is still 270.5MB. Free memory was 240.4MB in the beginning and 238.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,721 INFO L158 Benchmark]: RCFGBuilder took 315.48ms. Allocated memory is still 270.5MB. Free memory was 238.3MB in the beginning and 224.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,721 INFO L158 Benchmark]: IcfgTransformer took 60.70ms. Allocated memory is still 270.5MB. Free memory was 224.6MB in the beginning and 222.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,722 INFO L158 Benchmark]: TraceAbstraction took 33247.41ms. Allocated memory was 270.5MB in the beginning and 468.7MB in the end (delta: 198.2MB). Free memory was 222.1MB in the beginning and 271.2MB in the end (delta: -49.1MB). Peak memory consumption was 275.6MB. Max. memory is 8.0GB. [2022-04-15 05:03:11,723 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.96ms. Allocated memory was 195.0MB in the beginning and 270.5MB in the end (delta: 75.5MB). Free memory was 136.0MB in the beginning and 240.4MB in the end (delta: -104.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.93ms. Allocated memory is still 270.5MB. Free memory was 240.4MB in the beginning and 238.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.48ms. Allocated memory is still 270.5MB. Free memory was 238.3MB in the beginning and 224.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 60.70ms. Allocated memory is still 270.5MB. Free memory was 224.6MB in the beginning and 222.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 33247.41ms. Allocated memory was 270.5MB in the beginning and 468.7MB in the end (delta: 198.2MB). Free memory was 222.1MB in the beginning and 271.2MB in the end (delta: -49.1MB). Peak memory consumption was 275.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1622 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=22, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 05:03:11,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...