/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_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:56:17,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:56:17,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:56:17,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:56:17,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:56:17,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:56:17,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:56:17,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:56:17,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:56:17,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:56:17,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:56:17,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:56:17,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:56:17,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:56:17,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:56:17,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:56:17,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:56:17,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:56:17,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:56:17,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:56:17,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:56:17,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:56:17,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:56:17,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:56:17,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:56:17,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:56:17,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:56:17,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:56:17,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:56:17,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:56:17,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:56:17,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:56:17,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:56:17,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:56:17,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:56:17,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:56:17,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:56:17,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:56:17,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:56:17,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:56:17,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:56:17,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:56:17,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:56:17,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:56:17,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:56:17,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:56:17,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:56:17,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:56:17,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:56:17,315 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:56:17,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:56:17,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:56:17,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:56:17,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:17,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:56:17,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:56:17,318 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:56:17,318 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 02:56:17,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:56:17,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:56:17,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:56:17,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:56:17,508 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:56:17,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 02:56:17,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aab4cb05/1854b8d8b35f4b45a21f1927f1710dbc/FLAGa1994b5d8 [2022-04-08 02:56:17,915 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:56:17,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-08 02:56:17,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aab4cb05/1854b8d8b35f4b45a21f1927f1710dbc/FLAGa1994b5d8 [2022-04-08 02:56:17,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aab4cb05/1854b8d8b35f4b45a21f1927f1710dbc [2022-04-08 02:56:17,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:56:17,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:56:17,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:17,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:56:17,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:56:17,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:17" (1/1) ... [2022-04-08 02:56:17,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe1490c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:17, skipping insertion in model container [2022-04-08 02:56:17,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:56:17" (1/1) ... [2022-04-08 02:56:17,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:56:17,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:56:18,104 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_15-2.c[5628,5641] [2022-04-08 02:56:18,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:18,112 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:56:18,133 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_15-2.c[5628,5641] [2022-04-08 02:56:18,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:56:18,143 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:56:18,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18 WrapperNode [2022-04-08 02:56:18,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:56:18,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:56:18,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:56:18,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:56:18,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:56:18,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:56:18,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:56:18,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:56:18,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:56:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:56:18,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 02:56:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 02:56:18,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:56:18,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:56:18,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:56:18,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:56:18,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:56:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:56:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:56:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:56:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:56:18,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:56:18,280 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:56:18,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:56:18,566 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:56:18,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:56:18,576 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:56:18,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:18 BoogieIcfgContainer [2022-04-08 02:56:18,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:56:18,578 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:56:18,578 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:56:18,581 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:56:18,583 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:18" (1/1) ... [2022-04-08 02:56:18,585 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:56:18,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:18 BasicIcfg [2022-04-08 02:56:18,615 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:56:18,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:56:18,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:56:18,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:56:18,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:56:17" (1/4) ... [2022-04-08 02:56:18,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91edbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:18, skipping insertion in model container [2022-04-08 02:56:18,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:56:18" (2/4) ... [2022-04-08 02:56:18,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91edbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:56:18, skipping insertion in model container [2022-04-08 02:56:18,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:56:18" (3/4) ... [2022-04-08 02:56:18,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91edbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:56:18, skipping insertion in model container [2022-04-08 02:56:18,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:56:18" (4/4) ... [2022-04-08 02:56:18,630 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.cqvasr [2022-04-08 02:56:18,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:56:18,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:56:18,677 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:56:18,687 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:56:18,687 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:56:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:56:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:56:18,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:18,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:18,731 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 539653987, now seen corresponding path program 1 times [2022-04-08 02:56:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:18,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30320527] [2022-04-08 02:56:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:19,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {63#true} is VALID [2022-04-08 02:56:19,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-08 02:56:19,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-08 02:56:19,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:19,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {63#true} is VALID [2022-04-08 02:56:19,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-08 02:56:19,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-08 02:56:19,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-08 02:56:19,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {63#true} is VALID [2022-04-08 02:56:19,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {63#true} is VALID [2022-04-08 02:56:19,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {63#true} is VALID [2022-04-08 02:56:19,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} [301] L93-->L93-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} [304] L93-2-->L97-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[] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} [305] L97-1-->L101-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} [307] L101-1-->L105-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} [309] L105-1-->L109-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] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} [331] L149-1-->L156: 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[] {68#(= main_~lk1~0 1)} is VALID [2022-04-08 02:56:19,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} [333] L156-->L226-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[] {64#false} is VALID [2022-04-08 02:56:19,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#false} is VALID [2022-04-08 02:56:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:19,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30320527] [2022-04-08 02:56:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30320527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494225904] [2022-04-08 02:56:19,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:56:19,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:19,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:19,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:19,129 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:19,505 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-08 02:56:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:56:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 02:56:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-08 02:56:19,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-08 02:56:19,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:19,693 INFO L225 Difference]: With dead ends: 118 [2022-04-08 02:56:19,694 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 02:56:19,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:19,698 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:19,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 02:56:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-08 02:56:19,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:19,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,748 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,748 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:19,759 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 02:56:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 02:56:19,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:19,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:19,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-08 02:56:19,761 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-08 02:56:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:19,768 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-08 02:56:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-08 02:56:19,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:19,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:19,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:19,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-08 02:56:19,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-08 02:56:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:19,775 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-08 02:56:19,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-08 02:56:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:56:19,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:19,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, 1] [2022-04-08 02:56:19,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:56:19,777 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -457418366, now seen corresponding path program 1 times [2022-04-08 02:56:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231776196] [2022-04-08 02:56:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:19,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {488#true} is VALID [2022-04-08 02:56:19,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#true} is VALID [2022-04-08 02:56:19,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#true} is VALID [2022-04-08 02:56:19,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {488#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:19,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {488#true} is VALID [2022-04-08 02:56:19,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {488#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#true} is VALID [2022-04-08 02:56:19,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#true} is VALID [2022-04-08 02:56:19,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {488#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#true} is VALID [2022-04-08 02:56:19,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {488#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {488#true} is VALID [2022-04-08 02:56:19,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {488#true} is VALID [2022-04-08 02:56:19,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {488#true} is VALID [2022-04-08 02:56:19,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#true} [302] L93-->L93-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[] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(= main_~p1~0 0)} [304] L93-2-->L97-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[] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(= main_~p1~0 0)} [305] L97-1-->L101-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] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= main_~p1~0 0)} [307] L101-1-->L105-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] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= main_~p1~0 0)} [309] L105-1-->L109-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] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {493#(= main_~p1~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {493#(= main_~p1~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(= main_~p1~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#(= main_~p1~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {493#(= main_~p1~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {493#(= main_~p1~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {493#(= main_~p1~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {493#(= main_~p1~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {493#(= main_~p1~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {493#(= main_~p1~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {493#(= main_~p1~0 0)} is VALID [2022-04-08 02:56:19,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {493#(= main_~p1~0 0)} [331] L149-1-->L156: 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[] {489#false} is VALID [2022-04-08 02:56:19,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {489#false} [333] L156-->L226-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[] {489#false} is VALID [2022-04-08 02:56:19,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {489#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#false} is VALID [2022-04-08 02:56:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:19,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231776196] [2022-04-08 02:56:19,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231776196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:19,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263489514] [2022-04-08 02:56:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:56:19,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:19,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:19,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:19,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:19,889 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,230 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-08 02:56:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 02:56:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 02:56:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-08 02:56:20,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-08 02:56:20,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:20,479 INFO L225 Difference]: With dead ends: 168 [2022-04-08 02:56:20,479 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 02:56:20,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:20,480 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:20,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 02:56:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-08 02:56:20,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:20,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,488 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,488 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,491 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 02:56:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 02:56:20,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:20,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:20,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 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 103 states. [2022-04-08 02:56:20,492 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 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 103 states. [2022-04-08 02:56:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,509 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-08 02:56:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-08 02:56:20,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:20,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:20,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:20,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-08 02:56:20,513 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-08 02:56:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:20,513 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-08 02:56:20,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-08 02:56:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:56:20,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:20,514 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:20,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:56:20,515 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -450563475, now seen corresponding path program 1 times [2022-04-08 02:56:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:20,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979601166] [2022-04-08 02:56:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:20,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {992#true} is VALID [2022-04-08 02:56:20,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-08 02:56:20,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {992#true} {992#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-08 02:56:20,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {992#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:20,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {992#true} is VALID [2022-04-08 02:56:20,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-08 02:56:20,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {992#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-08 02:56:20,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {992#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#true} is VALID [2022-04-08 02:56:20,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {992#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {992#true} is VALID [2022-04-08 02:56:20,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {992#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {992#true} is VALID [2022-04-08 02:56:20,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {992#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {992#true} is VALID [2022-04-08 02:56:20,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#true} [301] L93-->L93-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] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(not (= main_~p1~0 0))} [304] L93-2-->L97-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[] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(not (= main_~p1~0 0))} [305] L97-1-->L101-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] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(not (= main_~p1~0 0))} [307] L101-1-->L105-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] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(not (= main_~p1~0 0))} [309] L105-1-->L109-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] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(not (= main_~p1~0 0))} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(not (= main_~p1~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {997#(not (= main_~p1~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {997#(not (= main_~p1~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {997#(not (= main_~p1~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {997#(not (= main_~p1~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {997#(not (= main_~p1~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {997#(not (= main_~p1~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(not (= main_~p1~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {997#(not (= main_~p1~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {997#(not (= main_~p1~0 0))} is VALID [2022-04-08 02:56:20,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(not (= main_~p1~0 0))} [332] L149-1-->L155-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[] {993#false} is VALID [2022-04-08 02:56:20,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {993#false} [335] L155-1-->L161: 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[] {993#false} is VALID [2022-04-08 02:56:20,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {993#false} [339] L161-->L226-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[] {993#false} is VALID [2022-04-08 02:56:20,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {993#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {993#false} is VALID [2022-04-08 02:56:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:20,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:20,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979601166] [2022-04-08 02:56:20,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979601166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:20,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:20,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751247961] [2022-04-08 02:56:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:20,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:20,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:20,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:20,597 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,792 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-08 02:56:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 02:56:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-08 02:56:20,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-08 02:56:20,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:20,976 INFO L225 Difference]: With dead ends: 154 [2022-04-08 02:56:20,976 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 02:56:20,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-08 02:56:20,977 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:20,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 02:56:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-08 02:56:20,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:20,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,984 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,984 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,987 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 02:56:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 02:56:20,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:20,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:20,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-08 02:56:20,988 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-08 02:56:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:20,991 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-08 02:56:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-08 02:56:20,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:20,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:20,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:20,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-08 02:56:20,994 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-08 02:56:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:20,994 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-08 02:56:20,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-08 02:56:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:56:20,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:20,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:20,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:56:20,996 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1295035346, now seen corresponding path program 1 times [2022-04-08 02:56:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:20,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757875283] [2022-04-08 02:56:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:21,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {1499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {1493#true} is VALID [2022-04-08 02:56:21,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#true} is VALID [2022-04-08 02:56:21,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#true} is VALID [2022-04-08 02:56:21,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:21,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {1493#true} is VALID [2022-04-08 02:56:21,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {1493#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {1493#true} is VALID [2022-04-08 02:56:21,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {1493#true} [302] L93-->L93-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[] {1493#true} is VALID [2022-04-08 02:56:21,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1493#true} [304] L93-2-->L97-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[] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(= main_~p2~0 0)} [305] L97-1-->L101-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] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(= main_~p2~0 0)} [307] L101-1-->L105-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] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(= main_~p2~0 0)} [309] L105-1-->L109-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] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {1498#(= main_~p2~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(= main_~p2~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(= main_~p2~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {1498#(= main_~p2~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {1498#(= main_~p2~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {1498#(= main_~p2~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {1498#(= main_~p2~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1498#(= main_~p2~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {1498#(= main_~p2~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {1498#(= main_~p2~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {1498#(= main_~p2~0 0)} [332] L149-1-->L155-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[] {1498#(= main_~p2~0 0)} is VALID [2022-04-08 02:56:21,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {1498#(= main_~p2~0 0)} [335] L155-1-->L161: 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[] {1494#false} is VALID [2022-04-08 02:56:21,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#false} [339] L161-->L226-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[] {1494#false} is VALID [2022-04-08 02:56:21,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1494#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1494#false} is VALID [2022-04-08 02:56:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757875283] [2022-04-08 02:56:21,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757875283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:21,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:21,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158168894] [2022-04-08 02:56:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:21,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:21,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:21,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:21,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:21,109 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,309 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-08 02:56:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 02:56:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-08 02:56:21,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-08 02:56:21,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:21,479 INFO L225 Difference]: With dead ends: 292 [2022-04-08 02:56:21,479 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 02:56:21,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:21,480 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:21,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 02:56:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-08 02:56:21,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:21,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,488 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,488 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,493 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 02:56:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 02:56:21,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:21,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:21,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 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 197 states. [2022-04-08 02:56:21,494 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 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 197 states. [2022-04-08 02:56:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,499 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-08 02:56:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-08 02:56:21,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:21,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:21,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:21,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-08 02:56:21,504 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-08 02:56:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:21,504 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-08 02:56:21,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-08 02:56:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 02:56:21,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:21,505 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:21,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 02:56:21,505 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash -297962993, now seen corresponding path program 1 times [2022-04-08 02:56:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:21,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651768739] [2022-04-08 02:56:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:21,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {2410#true} is VALID [2022-04-08 02:56:21,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-08 02:56:21,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2410#true} {2410#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-08 02:56:21,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:21,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {2410#true} is VALID [2022-04-08 02:56:21,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {2410#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2410#true} {2410#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {2410#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {2410#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {2410#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {2410#true} is VALID [2022-04-08 02:56:21,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} [302] L93-->L93-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[] {2410#true} is VALID [2022-04-08 02:56:21,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} [303] L93-2-->L97-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] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(= main_~lk2~0 1)} [305] L97-1-->L101-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] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(= main_~lk2~0 1)} [307] L101-1-->L105-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] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {2415#(= main_~lk2~0 1)} [309] L105-1-->L109-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] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(= main_~lk2~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2415#(= main_~lk2~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {2415#(= main_~lk2~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2415#(= main_~lk2~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2415#(= main_~lk2~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2415#(= main_~lk2~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2415#(= main_~lk2~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {2415#(= main_~lk2~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {2415#(= main_~lk2~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {2415#(= main_~lk2~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {2415#(= main_~lk2~0 1)} [332] L149-1-->L155-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[] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {2415#(= main_~lk2~0 1)} [335] L155-1-->L161: 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[] {2415#(= main_~lk2~0 1)} is VALID [2022-04-08 02:56:21,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {2415#(= main_~lk2~0 1)} [339] L161-->L226-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[] {2411#false} is VALID [2022-04-08 02:56:21,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {2411#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2411#false} is VALID [2022-04-08 02:56:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:21,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651768739] [2022-04-08 02:56:21,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651768739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:21,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:21,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827579599] [2022-04-08 02:56:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:21,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:21,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:21,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:21,594 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,795 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-08 02:56:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 02:56:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 02:56:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 02:56:21,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 02:56:21,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:21,943 INFO L225 Difference]: With dead ends: 255 [2022-04-08 02:56:21,943 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 02:56:21,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:21,944 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:21,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 02:56:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-08 02:56:21,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:21,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,951 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,951 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,957 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 02:56:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 02:56:21,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:21,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:21,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 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 253 states. [2022-04-08 02:56:21,959 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 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 253 states. [2022-04-08 02:56:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:21,964 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-08 02:56:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-08 02:56:21,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:21,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:21,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:21,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-08 02:56:21,969 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-08 02:56:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:21,969 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-08 02:56:21,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-08 02:56:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:56:21,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:21,970 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:21,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 02:56:21,970 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1491357826, now seen corresponding path program 1 times [2022-04-08 02:56:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:21,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964148424] [2022-04-08 02:56:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:22,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {3402#true} is VALID [2022-04-08 02:56:22,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {3402#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3402#true} is VALID [2022-04-08 02:56:22,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3402#true} {3402#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3402#true} is VALID [2022-04-08 02:56:22,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {3402#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:22,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {3402#true} is VALID [2022-04-08 02:56:22,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {3402#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3402#true} is VALID [2022-04-08 02:56:22,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3402#true} {3402#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {3402#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {3402#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {3402#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {3402#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {3402#true} [302] L93-->L93-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[] {3402#true} is VALID [2022-04-08 02:56:22,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {3402#true} [304] L93-2-->L97-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[] {3402#true} is VALID [2022-04-08 02:56:22,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {3402#true} [305] L97-1-->L101-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] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {3407#(= main_~lk3~0 1)} [307] L101-1-->L105-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] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {3407#(= main_~lk3~0 1)} [309] L105-1-->L109-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] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {3407#(= main_~lk3~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {3407#(= main_~lk3~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {3407#(= main_~lk3~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {3407#(= main_~lk3~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {3407#(= main_~lk3~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {3407#(= main_~lk3~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {3407#(= main_~lk3~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {3407#(= main_~lk3~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {3407#(= main_~lk3~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {3407#(= main_~lk3~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {3407#(= main_~lk3~0 1)} [332] L149-1-->L155-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[] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {3407#(= main_~lk3~0 1)} [336] L155-1-->L160-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[] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#(= main_~lk3~0 1)} [341] L160-1-->L166: 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[] {3407#(= main_~lk3~0 1)} is VALID [2022-04-08 02:56:22,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {3407#(= main_~lk3~0 1)} [343] L166-->L226-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[] {3403#false} is VALID [2022-04-08 02:56:22,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {3403#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3403#false} is VALID [2022-04-08 02:56:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:22,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964148424] [2022-04-08 02:56:22,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964148424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:22,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:22,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722951952] [2022-04-08 02:56:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 02:56:22,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:22,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:22,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:22,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:22,040 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,299 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-08 02:56:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 02:56:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 02:56:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-08 02:56:22,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-08 02:56:22,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:22,437 INFO L225 Difference]: With dead ends: 371 [2022-04-08 02:56:22,437 INFO L226 Difference]: Without dead ends: 369 [2022-04-08 02:56:22,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:22,439 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:22,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-08 02:56:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-08 02:56:22,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:22,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,447 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,448 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,457 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 02:56:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 02:56:22,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:22,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:22,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 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 369 states. [2022-04-08 02:56:22,459 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 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 369 states. [2022-04-08 02:56:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,469 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-08 02:56:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-08 02:56:22,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:22,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:22,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:22,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-08 02:56:22,477 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-08 02:56:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:22,478 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-08 02:56:22,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-08 02:56:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 02:56:22,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:22,478 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:22,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 02:56:22,479 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1806537117, now seen corresponding path program 1 times [2022-04-08 02:56:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328935428] [2022-04-08 02:56:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:22,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {4818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {4812#true} is VALID [2022-04-08 02:56:22,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {4812#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4812#true} is VALID [2022-04-08 02:56:22,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4812#true} {4812#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4812#true} is VALID [2022-04-08 02:56:22,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {4812#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:22,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {4812#true} is VALID [2022-04-08 02:56:22,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {4812#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4812#true} is VALID [2022-04-08 02:56:22,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4812#true} {4812#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4812#true} is VALID [2022-04-08 02:56:22,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {4812#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4812#true} is VALID [2022-04-08 02:56:22,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {4812#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4812#true} is VALID [2022-04-08 02:56:22,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {4812#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {4812#true} is VALID [2022-04-08 02:56:22,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {4812#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {4812#true} is VALID [2022-04-08 02:56:22,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {4812#true} [302] L93-->L93-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[] {4812#true} is VALID [2022-04-08 02:56:22,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {4812#true} [304] L93-2-->L97-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[] {4812#true} is VALID [2022-04-08 02:56:22,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4812#true} [306] L97-1-->L101-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[] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4817#(= main_~p3~0 0)} [307] L101-1-->L105-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] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4817#(= main_~p3~0 0)} [309] L105-1-->L109-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] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {4817#(= main_~p3~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4817#(= main_~p3~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {4817#(= main_~p3~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {4817#(= main_~p3~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4817#(= main_~p3~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {4817#(= main_~p3~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {4817#(= main_~p3~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {4817#(= main_~p3~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {4817#(= main_~p3~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {4817#(= main_~p3~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {4817#(= main_~p3~0 0)} [332] L149-1-->L155-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[] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {4817#(= main_~p3~0 0)} [336] L155-1-->L160-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[] {4817#(= main_~p3~0 0)} is VALID [2022-04-08 02:56:22,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {4817#(= main_~p3~0 0)} [341] L160-1-->L166: 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[] {4813#false} is VALID [2022-04-08 02:56:22,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {4813#false} [343] L166-->L226-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[] {4813#false} is VALID [2022-04-08 02:56:22,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {4813#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4813#false} is VALID [2022-04-08 02:56:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:22,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328935428] [2022-04-08 02:56:22,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328935428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:22,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:22,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983725575] [2022-04-08 02:56:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 02:56:22,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:22,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:22,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:22,558 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,764 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-08 02:56:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 02:56:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 02:56:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-08 02:56:22,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-08 02:56:22,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:22,941 INFO L225 Difference]: With dead ends: 631 [2022-04-08 02:56:22,942 INFO L226 Difference]: Without dead ends: 377 [2022-04-08 02:56:22,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:22,943 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:22,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-08 02:56:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-08 02:56:22,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:22,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,950 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,951 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,957 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 02:56:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 02:56:22,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:22,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:22,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 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 377 states. [2022-04-08 02:56:22,959 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 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 377 states. [2022-04-08 02:56:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:22,966 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-08 02:56:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-08 02:56:22,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:22,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:22,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:22,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-08 02:56:22,974 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-08 02:56:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:22,974 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-08 02:56:22,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-08 02:56:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:56:22,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:22,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:22,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 02:56:22,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1012580010, now seen corresponding path program 1 times [2022-04-08 02:56:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:22,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63638232] [2022-04-08 02:56:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:23,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:23,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {6618#true} is VALID [2022-04-08 02:56:23,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6618#true} is VALID [2022-04-08 02:56:23,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6618#true} {6618#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:23,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6618#true} is VALID [2022-04-08 02:56:23,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {6618#true} is VALID [2022-04-08 02:56:23,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {6618#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {6618#true} is VALID [2022-04-08 02:56:23,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {6618#true} [302] L93-->L93-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[] {6618#true} is VALID [2022-04-08 02:56:23,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {6618#true} [304] L93-2-->L97-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[] {6618#true} is VALID [2022-04-08 02:56:23,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {6618#true} [305] L97-1-->L101-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] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {6623#(not (= main_~p3~0 0))} [307] L101-1-->L105-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] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {6623#(not (= main_~p3~0 0))} [309] L105-1-->L109-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] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {6623#(not (= main_~p3~0 0))} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {6623#(not (= main_~p3~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {6623#(not (= main_~p3~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {6623#(not (= main_~p3~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {6623#(not (= main_~p3~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {6623#(not (= main_~p3~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {6623#(not (= main_~p3~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {6623#(not (= main_~p3~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {6623#(not (= main_~p3~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {6623#(not (= main_~p3~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {6623#(not (= main_~p3~0 0))} [332] L149-1-->L155-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[] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {6623#(not (= main_~p3~0 0))} [336] L155-1-->L160-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[] {6623#(not (= main_~p3~0 0))} is VALID [2022-04-08 02:56:23,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {6623#(not (= main_~p3~0 0))} [342] L160-1-->L165-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[] {6619#false} is VALID [2022-04-08 02:56:23,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {6619#false} [345] L165-1-->L171: 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[] {6619#false} is VALID [2022-04-08 02:56:23,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {6619#false} [347] L171-->L226-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[] {6619#false} is VALID [2022-04-08 02:56:23,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {6619#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6619#false} is VALID [2022-04-08 02:56:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63638232] [2022-04-08 02:56:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63638232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:23,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:23,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700850121] [2022-04-08 02:56:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:23,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:23,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:23,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:23,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:23,054 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,266 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-08 02:56:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 02:56:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-08 02:56:23,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-08 02:56:23,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:23,435 INFO L225 Difference]: With dead ends: 565 [2022-04-08 02:56:23,435 INFO L226 Difference]: Without dead ends: 383 [2022-04-08 02:56:23,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:23,437 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:23,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-08 02:56:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-08 02:56:23,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:23,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,452 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,453 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,460 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 02:56:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 02:56:23,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:23,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:23,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 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 383 states. [2022-04-08 02:56:23,462 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 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 383 states. [2022-04-08 02:56:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,469 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-08 02:56:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-08 02:56:23,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:23,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:23,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:23,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-08 02:56:23,478 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-08 02:56:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:23,478 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-08 02:56:23,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-08 02:56:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:56:23,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:23,483 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:23,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 02:56:23,484 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 168108139, now seen corresponding path program 1 times [2022-04-08 02:56:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900493330] [2022-04-08 02:56:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:23,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {8382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {8376#true} is VALID [2022-04-08 02:56:23,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {8376#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8376#true} is VALID [2022-04-08 02:56:23,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8376#true} {8376#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8376#true} is VALID [2022-04-08 02:56:23,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {8376#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:23,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {8382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {8376#true} is VALID [2022-04-08 02:56:23,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {8376#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8376#true} {8376#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {8376#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {8376#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {8376#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {8376#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#true} [302] L93-->L93-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[] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {8376#true} [304] L93-2-->L97-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[] {8376#true} is VALID [2022-04-08 02:56:23,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {8376#true} [306] L97-1-->L101-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[] {8376#true} is VALID [2022-04-08 02:56:23,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {8376#true} [307] L101-1-->L105-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] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {8381#(= main_~lk4~0 1)} [309] L105-1-->L109-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] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {8381#(= main_~lk4~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {8381#(= main_~lk4~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {8381#(= main_~lk4~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {8381#(= main_~lk4~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {8381#(= main_~lk4~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {8381#(= main_~lk4~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {8381#(= main_~lk4~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {8381#(= main_~lk4~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {8381#(= main_~lk4~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {8381#(= main_~lk4~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {8381#(= main_~lk4~0 1)} [332] L149-1-->L155-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[] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {8381#(= main_~lk4~0 1)} [336] L155-1-->L160-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[] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {8381#(= main_~lk4~0 1)} [342] L160-1-->L165-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[] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {8381#(= main_~lk4~0 1)} [345] L165-1-->L171: 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[] {8381#(= main_~lk4~0 1)} is VALID [2022-04-08 02:56:23,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {8381#(= main_~lk4~0 1)} [347] L171-->L226-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[] {8377#false} is VALID [2022-04-08 02:56:23,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {8377#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8377#false} is VALID [2022-04-08 02:56:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900493330] [2022-04-08 02:56:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900493330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:23,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2855374] [2022-04-08 02:56:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:23,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:23,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:23,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:23,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:23,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:23,574 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,800 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-08 02:56:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 02:56:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-08 02:56:23,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-08 02:56:23,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:23,927 INFO L225 Difference]: With dead ends: 717 [2022-04-08 02:56:23,927 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 02:56:23,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:23,928 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:23,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 02:56:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-08 02:56:23,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:23,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,955 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,956 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,972 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 02:56:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 02:56:23,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:23,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 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-08 02:56:23,974 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 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-08 02:56:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:23,999 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-08 02:56:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-08 02:56:24,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:24,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:24,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:24,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-08 02:56:24,018 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-08 02:56:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:24,018 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-08 02:56:24,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-08 02:56:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:56:24,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:24,020 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:24,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 02:56:24,021 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash -828964214, now seen corresponding path program 1 times [2022-04-08 02:56:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:24,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575464394] [2022-04-08 02:56:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:24,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {11100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {11094#true} is VALID [2022-04-08 02:56:24,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {11094#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#true} is VALID [2022-04-08 02:56:24,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11094#true} {11094#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#true} is VALID [2022-04-08 02:56:24,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {11094#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:24,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {11100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {11094#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11094#true} {11094#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {11094#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {11094#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {11094#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {11094#true} is VALID [2022-04-08 02:56:24,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {11094#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {11094#true} is VALID [2022-04-08 02:56:24,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {11094#true} [302] L93-->L93-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[] {11094#true} is VALID [2022-04-08 02:56:24,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {11094#true} [304] L93-2-->L97-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[] {11094#true} is VALID [2022-04-08 02:56:24,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {11094#true} [306] L97-1-->L101-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[] {11094#true} is VALID [2022-04-08 02:56:24,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {11094#true} [308] L101-1-->L105-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[] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {11099#(= main_~p4~0 0)} [309] L105-1-->L109-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] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {11099#(= main_~p4~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {11099#(= main_~p4~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {11099#(= main_~p4~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {11099#(= main_~p4~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {11099#(= main_~p4~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {11099#(= main_~p4~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {11099#(= main_~p4~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {11099#(= main_~p4~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {11099#(= main_~p4~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {11099#(= main_~p4~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {11099#(= main_~p4~0 0)} [332] L149-1-->L155-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[] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {11099#(= main_~p4~0 0)} [336] L155-1-->L160-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[] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {11099#(= main_~p4~0 0)} [342] L160-1-->L165-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[] {11099#(= main_~p4~0 0)} is VALID [2022-04-08 02:56:24,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {11099#(= main_~p4~0 0)} [345] L165-1-->L171: 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[] {11095#false} is VALID [2022-04-08 02:56:24,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {11095#false} [347] L171-->L226-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[] {11095#false} is VALID [2022-04-08 02:56:24,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {11095#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11095#false} is VALID [2022-04-08 02:56:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575464394] [2022-04-08 02:56:24,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575464394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:24,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530153151] [2022-04-08 02:56:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:24,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:24,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:24,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:24,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:24,121 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:24,348 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-08 02:56:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 02:56:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 02:56:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-08 02:56:24,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-08 02:56:24,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:24,519 INFO L225 Difference]: With dead ends: 1245 [2022-04-08 02:56:24,520 INFO L226 Difference]: Without dead ends: 739 [2022-04-08 02:56:24,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:24,521 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:24,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-08 02:56:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-08 02:56:24,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:24,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,534 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,534 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:24,551 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 02:56:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 02:56:24,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:24,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:24,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 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 739 states. [2022-04-08 02:56:24,554 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 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 739 states. [2022-04-08 02:56:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:24,573 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-08 02:56:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-08 02:56:24,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:24,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:24,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:24,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-08 02:56:24,592 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-08 02:56:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:24,593 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-08 02:56:24,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-08 02:56:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:56:24,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:24,594 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:24,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 02:56:24,594 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 916417497, now seen corresponding path program 1 times [2022-04-08 02:56:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:24,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620163069] [2022-04-08 02:56:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:24,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {14626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {14620#true} is VALID [2022-04-08 02:56:24,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {14620#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14620#true} is VALID [2022-04-08 02:56:24,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14620#true} {14620#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {14620#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:24,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {14626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {14620#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14620#true} {14620#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {14620#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {14620#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {14620#true} is VALID [2022-04-08 02:56:24,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {14620#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {14620#true} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {14620#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {14620#true} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {14620#true} [302] L93-->L93-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[] {14620#true} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {14620#true} [304] L93-2-->L97-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[] {14620#true} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {14620#true} [306] L97-1-->L101-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[] {14620#true} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#true} [307] L101-1-->L105-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] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {14625#(not (= main_~p4~0 0))} [309] L105-1-->L109-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] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {14625#(not (= main_~p4~0 0))} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {14625#(not (= main_~p4~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {14625#(not (= main_~p4~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {14625#(not (= main_~p4~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {14625#(not (= main_~p4~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {14625#(not (= main_~p4~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {14625#(not (= main_~p4~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {14625#(not (= main_~p4~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {14625#(not (= main_~p4~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {14625#(not (= main_~p4~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {14625#(not (= main_~p4~0 0))} [332] L149-1-->L155-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[] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {14625#(not (= main_~p4~0 0))} [336] L155-1-->L160-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[] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {14625#(not (= main_~p4~0 0))} [342] L160-1-->L165-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[] {14625#(not (= main_~p4~0 0))} is VALID [2022-04-08 02:56:24,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {14625#(not (= main_~p4~0 0))} [346] L165-1-->L170-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[] {14621#false} is VALID [2022-04-08 02:56:24,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {14621#false} [349] L170-1-->L176: 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[] {14621#false} is VALID [2022-04-08 02:56:24,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {14621#false} [351] L176-->L226-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[] {14621#false} is VALID [2022-04-08 02:56:24,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {14621#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14621#false} is VALID [2022-04-08 02:56:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620163069] [2022-04-08 02:56:24,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620163069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:24,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:24,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837624225] [2022-04-08 02:56:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:24,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:24,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:24,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:24,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:24,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:24,653 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:24,948 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-08 02:56:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 02:56:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-08 02:56:24,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-08 02:56:25,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:25,155 INFO L225 Difference]: With dead ends: 1105 [2022-04-08 02:56:25,156 INFO L226 Difference]: Without dead ends: 747 [2022-04-08 02:56:25,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-08 02:56:25,157 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:25,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-08 02:56:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-08 02:56:25,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:25,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,184 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,184 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:25,203 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 02:56:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 02:56:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:25,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:25,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 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 747 states. [2022-04-08 02:56:25,206 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 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 747 states. [2022-04-08 02:56:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:25,223 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-08 02:56:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-08 02:56:25,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:25,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:25,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:25,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-08 02:56:25,243 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-08 02:56:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:25,243 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-08 02:56:25,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-08 02:56:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:56:25,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:25,244 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:25,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 02:56:25,244 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 71945626, now seen corresponding path program 1 times [2022-04-08 02:56:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:25,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615600114] [2022-04-08 02:56:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:25,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {18036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {18030#true} is VALID [2022-04-08 02:56:25,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {18030#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18030#true} is VALID [2022-04-08 02:56:25,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18030#true} {18030#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {18030#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:25,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {18036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {18030#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18030#true} {18030#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {18030#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {18030#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {18030#true} is VALID [2022-04-08 02:56:25,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {18030#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {18030#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {18030#true} [302] L93-->L93-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[] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {18030#true} [304] L93-2-->L97-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[] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {18030#true} [306] L97-1-->L101-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[] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {18030#true} [308] L101-1-->L105-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[] {18030#true} is VALID [2022-04-08 02:56:25,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {18030#true} [309] L105-1-->L109-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] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {18035#(= main_~lk5~0 1)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {18035#(= main_~lk5~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {18035#(= main_~lk5~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {18035#(= main_~lk5~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {18035#(= main_~lk5~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {18035#(= main_~lk5~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {18035#(= main_~lk5~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {18035#(= main_~lk5~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {18035#(= main_~lk5~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {18035#(= main_~lk5~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {18035#(= main_~lk5~0 1)} [332] L149-1-->L155-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[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {18035#(= main_~lk5~0 1)} [336] L155-1-->L160-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[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {18035#(= main_~lk5~0 1)} [342] L160-1-->L165-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[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {18035#(= main_~lk5~0 1)} [346] L165-1-->L170-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[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {18035#(= main_~lk5~0 1)} [349] L170-1-->L176: 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[] {18035#(= main_~lk5~0 1)} is VALID [2022-04-08 02:56:25,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {18035#(= main_~lk5~0 1)} [351] L176-->L226-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[] {18031#false} is VALID [2022-04-08 02:56:25,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {18031#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18031#false} is VALID [2022-04-08 02:56:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:25,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615600114] [2022-04-08 02:56:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615600114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:25,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:25,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413309924] [2022-04-08 02:56:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:25,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:25,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:25,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:25,310 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:25,531 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-08 02:56:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 02:56:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-08 02:56:25,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-08 02:56:25,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:25,696 INFO L225 Difference]: With dead ends: 1389 [2022-04-08 02:56:25,696 INFO L226 Difference]: Without dead ends: 1387 [2022-04-08 02:56:25,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:25,697 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:25,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:56:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-08 02:56:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-08 02:56:25,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:25,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,714 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,715 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:25,768 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 02:56:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 02:56:25,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:25,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:25,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 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 1387 states. [2022-04-08 02:56:25,774 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 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 1387 states. [2022-04-08 02:56:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:25,834 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-08 02:56:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-08 02:56:25,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:25,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:25,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:25,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-08 02:56:25,869 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-08 02:56:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:25,869 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-08 02:56:25,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-08 02:56:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 02:56:25,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:25,870 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:25,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 02:56:25,870 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -925126727, now seen corresponding path program 1 times [2022-04-08 02:56:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:25,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447345630] [2022-04-08 02:56:25,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:25,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {23306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {23300#true} is VALID [2022-04-08 02:56:25,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {23300#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23300#true} is VALID [2022-04-08 02:56:25,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23300#true} {23300#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23300#true} is VALID [2022-04-08 02:56:25,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {23300#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:25,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {23306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {23300#true} is VALID [2022-04-08 02:56:25,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {23300#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23300#true} is VALID [2022-04-08 02:56:25,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23300#true} {23300#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23300#true} is VALID [2022-04-08 02:56:25,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {23300#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23300#true} is VALID [2022-04-08 02:56:25,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {23300#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {23300#true} is VALID [2022-04-08 02:56:25,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {23300#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {23300#true} is VALID [2022-04-08 02:56:25,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {23300#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {23300#true} is VALID [2022-04-08 02:56:25,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {23300#true} [302] L93-->L93-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[] {23300#true} is VALID [2022-04-08 02:56:25,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {23300#true} [304] L93-2-->L97-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[] {23300#true} is VALID [2022-04-08 02:56:25,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {23300#true} [306] L97-1-->L101-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[] {23300#true} is VALID [2022-04-08 02:56:25,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {23300#true} [308] L101-1-->L105-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[] {23300#true} is VALID [2022-04-08 02:56:25,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {23300#true} [310] L105-1-->L109-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[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {23305#(= main_~p5~0 0)} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {23305#(= main_~p5~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {23305#(= main_~p5~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {23305#(= main_~p5~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {23305#(= main_~p5~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {23305#(= main_~p5~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {23305#(= main_~p5~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {23305#(= main_~p5~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {23305#(= main_~p5~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {23305#(= main_~p5~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {23305#(= main_~p5~0 0)} [332] L149-1-->L155-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[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {23305#(= main_~p5~0 0)} [336] L155-1-->L160-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[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {23305#(= main_~p5~0 0)} [342] L160-1-->L165-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[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {23305#(= main_~p5~0 0)} [346] L165-1-->L170-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[] {23305#(= main_~p5~0 0)} is VALID [2022-04-08 02:56:25,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {23305#(= main_~p5~0 0)} [349] L170-1-->L176: 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[] {23301#false} is VALID [2022-04-08 02:56:25,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {23301#false} [351] L176-->L226-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[] {23301#false} is VALID [2022-04-08 02:56:25,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {23301#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23301#false} is VALID [2022-04-08 02:56:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447345630] [2022-04-08 02:56:25,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447345630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:25,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:25,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51898025] [2022-04-08 02:56:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:25,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:25,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:25,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:25,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:25,952 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:26,305 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-08 02:56:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 02:56:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 02:56:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-08 02:56:26,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-08 02:56:26,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:26,538 INFO L225 Difference]: With dead ends: 2461 [2022-04-08 02:56:26,538 INFO L226 Difference]: Without dead ends: 1451 [2022-04-08 02:56:26,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:26,540 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:26,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-08 02:56:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-08 02:56:26,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:26,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,565 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,567 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:26,621 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 02:56:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 02:56:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:26,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:26,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1451 states. [2022-04-08 02:56:26,627 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1451 states. [2022-04-08 02:56:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:26,682 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-08 02:56:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-08 02:56:26,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:26,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:26,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:26,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-08 02:56:26,742 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-08 02:56:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:26,742 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-08 02:56:26,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-08 02:56:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:56:26,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:26,744 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:26,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 02:56:26,744 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2064620282, now seen corresponding path program 1 times [2022-04-08 02:56:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921275444] [2022-04-08 02:56:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:26,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {30224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {30218#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30218#true} {30218#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {30218#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:26,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {30224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {30218#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30218#true} {30218#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30218#true} is VALID [2022-04-08 02:56:26,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {30218#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {30218#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {30218#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {30218#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {30218#true} [302] L93-->L93-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[] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {30218#true} [304] L93-2-->L97-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[] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {30218#true} [306] L97-1-->L101-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[] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {30218#true} [308] L101-1-->L105-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[] {30218#true} is VALID [2022-04-08 02:56:26,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {30218#true} [309] L105-1-->L109-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] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {30223#(not (= main_~p5~0 0))} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {30223#(not (= main_~p5~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {30223#(not (= main_~p5~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {30223#(not (= main_~p5~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {30223#(not (= main_~p5~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {30223#(not (= main_~p5~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {30223#(not (= main_~p5~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {30223#(not (= main_~p5~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {30223#(not (= main_~p5~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {30223#(not (= main_~p5~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {30223#(not (= main_~p5~0 0))} [332] L149-1-->L155-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[] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {30223#(not (= main_~p5~0 0))} [336] L155-1-->L160-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[] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {30223#(not (= main_~p5~0 0))} [342] L160-1-->L165-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[] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {30223#(not (= main_~p5~0 0))} [346] L165-1-->L170-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[] {30223#(not (= main_~p5~0 0))} is VALID [2022-04-08 02:56:26,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {30223#(not (= main_~p5~0 0))} [350] L170-1-->L175-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[] {30219#false} is VALID [2022-04-08 02:56:26,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {30219#false} [353] L175-1-->L181: Formula: (not (= 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[] {30219#false} is VALID [2022-04-08 02:56:26,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {30219#false} [355] L181-->L226-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {30219#false} is VALID [2022-04-08 02:56:26,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {30219#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30219#false} is VALID [2022-04-08 02:56:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:26,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921275444] [2022-04-08 02:56:26,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921275444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:26,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:26,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330934084] [2022-04-08 02:56:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:26,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:26,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:26,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:26,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:26,801 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:27,100 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-08 02:56:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:27,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 02:56:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-08 02:56:27,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-08 02:56:27,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:27,345 INFO L225 Difference]: With dead ends: 2173 [2022-04-08 02:56:27,346 INFO L226 Difference]: Without dead ends: 1467 [2022-04-08 02:56:27,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:27,348 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:27,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-08 02:56:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-08 02:56:27,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:27,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,382 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,383 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:27,439 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 02:56:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 02:56:27,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:27,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:27,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1467 states. [2022-04-08 02:56:27,444 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 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 1467 states. [2022-04-08 02:56:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:27,526 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-08 02:56:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-08 02:56:27,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:27,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:27,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:27,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-08 02:56:27,617 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-08 02:56:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:27,617 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-08 02:56:27,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-08 02:56:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:56:27,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:27,618 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:27,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 02:56:27,618 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1385875143, now seen corresponding path program 1 times [2022-04-08 02:56:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:27,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996593003] [2022-04-08 02:56:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:27,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:27,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {36902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {36896#true} is VALID [2022-04-08 02:56:27,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {36896#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36896#true} is VALID [2022-04-08 02:56:27,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36896#true} {36896#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36896#true} is VALID [2022-04-08 02:56:27,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {36896#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:27,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {36902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {36896#true} is VALID [2022-04-08 02:56:27,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {36896#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36896#true} {36896#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {36896#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {36896#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {36896#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {36896#true} [302] L93-->L93-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[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {36896#true} [304] L93-2-->L97-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[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {36896#true} [306] L97-1-->L101-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[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {36896#true} [308] L101-1-->L105-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[] {36896#true} is VALID [2022-04-08 02:56:27,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {36896#true} [310] L105-1-->L109-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[] {36896#true} is VALID [2022-04-08 02:56:27,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {36896#true} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {36901#(= main_~lk6~0 1)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {36901#(= main_~lk6~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {36901#(= main_~lk6~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {36901#(= main_~lk6~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {36901#(= main_~lk6~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {36901#(= main_~lk6~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {36901#(= main_~lk6~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {36901#(= main_~lk6~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {36901#(= main_~lk6~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {36901#(= main_~lk6~0 1)} [332] L149-1-->L155-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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {36901#(= main_~lk6~0 1)} [336] L155-1-->L160-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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {36901#(= main_~lk6~0 1)} [342] L160-1-->L165-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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {36901#(= main_~lk6~0 1)} [346] L165-1-->L170-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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {36901#(= main_~lk6~0 1)} [350] L170-1-->L175-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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {36901#(= main_~lk6~0 1)} [353] L175-1-->L181: Formula: (not (= 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[] {36901#(= main_~lk6~0 1)} is VALID [2022-04-08 02:56:27,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {36901#(= main_~lk6~0 1)} [355] L181-->L226-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {36897#false} is VALID [2022-04-08 02:56:27,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {36897#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36897#false} is VALID [2022-04-08 02:56:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:27,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996593003] [2022-04-08 02:56:27,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996593003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:27,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:27,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458730419] [2022-04-08 02:56:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:27,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:27,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:27,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:27,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:27,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:27,674 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:28,074 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-08 02:56:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 02:56:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-08 02:56:28,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-08 02:56:28,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:28,377 INFO L225 Difference]: With dead ends: 2701 [2022-04-08 02:56:28,378 INFO L226 Difference]: Without dead ends: 2699 [2022-04-08 02:56:28,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:28,378 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:28,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-08 02:56:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-08 02:56:28,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:28,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,410 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,412 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:28,581 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 02:56:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 02:56:28,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:28,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:28,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 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 2699 states. [2022-04-08 02:56:28,589 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 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 2699 states. [2022-04-08 02:56:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:28,761 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-08 02:56:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-08 02:56:28,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:28,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:28,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:28,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-08 02:56:28,877 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-08 02:56:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:28,877 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-08 02:56:28,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-08 02:56:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 02:56:28,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:28,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:28,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 02:56:28,880 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 388802790, now seen corresponding path program 1 times [2022-04-08 02:56:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:28,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973761881] [2022-04-08 02:56:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:28,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {47180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {47174#true} is VALID [2022-04-08 02:56:28,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {47174#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47174#true} is VALID [2022-04-08 02:56:28,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47174#true} {47174#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47174#true} is VALID [2022-04-08 02:56:28,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {47174#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:28,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {47180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {47174#true} is VALID [2022-04-08 02:56:28,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {47174#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47174#true} {47174#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {47174#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {47174#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {47174#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {47174#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {47174#true} [302] L93-->L93-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[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {47174#true} [304] L93-2-->L97-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[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {47174#true} [306] L97-1-->L101-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[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {47174#true} [308] L101-1-->L105-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[] {47174#true} is VALID [2022-04-08 02:56:28,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {47174#true} [310] L105-1-->L109-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[] {47174#true} is VALID [2022-04-08 02:56:28,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {47174#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {47179#(= main_~p6~0 0)} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {47179#(= main_~p6~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {47179#(= main_~p6~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {47179#(= main_~p6~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {47179#(= main_~p6~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {47179#(= main_~p6~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {47179#(= main_~p6~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {47179#(= main_~p6~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {47179#(= main_~p6~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {47179#(= main_~p6~0 0)} [332] L149-1-->L155-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[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {47179#(= main_~p6~0 0)} [336] L155-1-->L160-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[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {47179#(= main_~p6~0 0)} [342] L160-1-->L165-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[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {47179#(= main_~p6~0 0)} [346] L165-1-->L170-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[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {47179#(= main_~p6~0 0)} [350] L170-1-->L175-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[] {47179#(= main_~p6~0 0)} is VALID [2022-04-08 02:56:28,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {47179#(= main_~p6~0 0)} [353] L175-1-->L181: Formula: (not (= 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[] {47175#false} is VALID [2022-04-08 02:56:28,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {47175#false} [355] L181-->L226-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {47175#false} is VALID [2022-04-08 02:56:28,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {47175#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47175#false} is VALID [2022-04-08 02:56:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973761881] [2022-04-08 02:56:28,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973761881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:28,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:28,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388503295] [2022-04-08 02:56:28,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:28,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:28,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:28,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:28,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:28,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:28,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:28,961 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:29,755 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-08 02:56:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 02:56:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 02:56:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-08 02:56:29,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-08 02:56:29,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:30,152 INFO L225 Difference]: With dead ends: 4877 [2022-04-08 02:56:30,152 INFO L226 Difference]: Without dead ends: 2859 [2022-04-08 02:56:30,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:30,155 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:30,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-08 02:56:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-08 02:56:30,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:30,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:30,215 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:30,218 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:30,456 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 02:56:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 02:56:30,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:30,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:30,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2859 states. [2022-04-08 02:56:30,466 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2859 states. [2022-04-08 02:56:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:30,709 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-08 02:56:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-08 02:56:30,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:30,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:30,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:30,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-08 02:56:30,950 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-08 02:56:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:30,950 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-08 02:56:30,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-08 02:56:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 02:56:30,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:30,952 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:30,952 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 02:56:30,952 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash 12489205, now seen corresponding path program 1 times [2022-04-08 02:56:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:30,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175280508] [2022-04-08 02:56:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:30,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {60818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {60812#true} is VALID [2022-04-08 02:56:30,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {60812#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60812#true} is VALID [2022-04-08 02:56:30,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60812#true} {60812#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {60812#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {60818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {60812#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60812#true} {60812#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {60812#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {60812#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {60812#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {60812#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {60812#true} is VALID [2022-04-08 02:56:30,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {60812#true} [302] L93-->L93-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[] {60812#true} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {60812#true} [304] L93-2-->L97-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[] {60812#true} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {60812#true} [306] L97-1-->L101-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[] {60812#true} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {60812#true} [308] L101-1-->L105-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[] {60812#true} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {60812#true} [310] L105-1-->L109-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[] {60812#true} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {60812#true} [311] L109-1-->L113-1: Formula: (and (not (= v_main_~p6~0_2 0)) (= v_main_~lk6~0_3 1)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[main_~lk6~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {60817#(not (= main_~p6~0 0))} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {60817#(not (= main_~p6~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {60817#(not (= main_~p6~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {60817#(not (= main_~p6~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {60817#(not (= main_~p6~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {60817#(not (= main_~p6~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {60817#(not (= main_~p6~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {60817#(not (= main_~p6~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {60817#(not (= main_~p6~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {60817#(not (= main_~p6~0 0))} [332] L149-1-->L155-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[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {60817#(not (= main_~p6~0 0))} [336] L155-1-->L160-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[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {60817#(not (= main_~p6~0 0))} [342] L160-1-->L165-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[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {60817#(not (= main_~p6~0 0))} [346] L165-1-->L170-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[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {60817#(not (= main_~p6~0 0))} [350] L170-1-->L175-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[] {60817#(not (= main_~p6~0 0))} is VALID [2022-04-08 02:56:30,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {60817#(not (= main_~p6~0 0))} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {60813#false} is VALID [2022-04-08 02:56:30,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {60813#false} [357] L180-1-->L186: Formula: (not (= v_main_~p7~0_4 0)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[] {60813#false} is VALID [2022-04-08 02:56:30,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {60813#false} [359] L186-->L226-1: Formula: (not (= v_main_~lk7~0_4 1)) InVars {main_~lk7~0=v_main_~lk7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_4} AuxVars[] AssignedVars[] {60813#false} is VALID [2022-04-08 02:56:30,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {60813#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60813#false} is VALID [2022-04-08 02:56:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175280508] [2022-04-08 02:56:30,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175280508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:30,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:30,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009135726] [2022-04-08 02:56:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:30,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:30,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:30,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:31,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:31,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:31,010 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:31,736 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-08 02:56:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 02:56:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-08 02:56:31,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-08 02:56:31,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:32,129 INFO L225 Difference]: With dead ends: 4285 [2022-04-08 02:56:32,130 INFO L226 Difference]: Without dead ends: 2891 [2022-04-08 02:56:32,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:32,133 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:32,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-08 02:56:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-08 02:56:32,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:32,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,201 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,205 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:32,428 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 02:56:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 02:56:32,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:32,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:32,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2891 states. [2022-04-08 02:56:32,436 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 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 2891 states. [2022-04-08 02:56:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:32,638 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-08 02:56:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-08 02:56:32,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:32,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:32,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:32,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-08 02:56:32,848 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-08 02:56:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:32,848 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-08 02:56:32,848 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-08 02:56:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 02:56:32,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:32,850 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:32,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 02:56:32,850 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash -831982666, now seen corresponding path program 1 times [2022-04-08 02:56:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:32,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965140445] [2022-04-08 02:56:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:32,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {73960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {73954#true} is VALID [2022-04-08 02:56:32,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {73954#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73954#true} {73954#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {73954#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:32,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {73960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {73954#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73954#true} {73954#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {73954#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {73954#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {73954#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {73954#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {73954#true} [302] L93-->L93-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[] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {73954#true} [304] L93-2-->L97-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[] {73954#true} is VALID [2022-04-08 02:56:32,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {73954#true} [306] L97-1-->L101-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[] {73954#true} is VALID [2022-04-08 02:56:32,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {73954#true} [308] L101-1-->L105-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[] {73954#true} is VALID [2022-04-08 02:56:32,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {73954#true} [310] L105-1-->L109-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[] {73954#true} is VALID [2022-04-08 02:56:32,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {73954#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {73954#true} is VALID [2022-04-08 02:56:32,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {73954#true} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {73959#(= main_~lk7~0 1)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {73959#(= main_~lk7~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {73959#(= main_~lk7~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {73959#(= main_~lk7~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {73959#(= main_~lk7~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {73959#(= main_~lk7~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {73959#(= main_~lk7~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {73959#(= main_~lk7~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {73959#(= main_~lk7~0 1)} [332] L149-1-->L155-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[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {73959#(= main_~lk7~0 1)} [336] L155-1-->L160-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[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {73959#(= main_~lk7~0 1)} [342] L160-1-->L165-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[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {73959#(= main_~lk7~0 1)} [346] L165-1-->L170-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[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {73959#(= main_~lk7~0 1)} [350] L170-1-->L175-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[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {73959#(= main_~lk7~0 1)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {73959#(= main_~lk7~0 1)} [357] L180-1-->L186: Formula: (not (= v_main_~p7~0_4 0)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[] {73959#(= main_~lk7~0 1)} is VALID [2022-04-08 02:56:32,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {73959#(= main_~lk7~0 1)} [359] L186-->L226-1: Formula: (not (= v_main_~lk7~0_4 1)) InVars {main_~lk7~0=v_main_~lk7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_4} AuxVars[] AssignedVars[] {73955#false} is VALID [2022-04-08 02:56:32,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {73955#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73955#false} is VALID [2022-04-08 02:56:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:32,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:32,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965140445] [2022-04-08 02:56:32,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965140445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:32,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:32,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:32,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535053779] [2022-04-08 02:56:32,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:32,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:32,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:32,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:32,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:32,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:32,938 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:33,900 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-08 02:56:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 02:56:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-08 02:56:33,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-08 02:56:34,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:34,904 INFO L225 Difference]: With dead ends: 5261 [2022-04-08 02:56:34,904 INFO L226 Difference]: Without dead ends: 5259 [2022-04-08 02:56:34,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:34,905 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:34,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-08 02:56:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-08 02:56:34,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:34,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:34,968 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:34,972 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:35,651 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 02:56:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 02:56:35,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:35,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:35,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 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 5259 states. [2022-04-08 02:56:35,664 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 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 5259 states. [2022-04-08 02:56:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:36,377 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-08 02:56:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-08 02:56:36,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:36,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:36,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:36,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-08 02:56:36,859 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-08 02:56:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:36,860 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-08 02:56:36,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-08 02:56:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 02:56:36,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:36,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:36,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 02:56:36,862 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:36,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1829055019, now seen corresponding path program 1 times [2022-04-08 02:56:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:36,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673379335] [2022-04-08 02:56:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:36,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {94062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {94056#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94056#true} {94056#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {94056#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {94062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {94056#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94056#true} {94056#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {94056#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {94056#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {94056#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {94056#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {94056#true} [302] L93-->L93-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[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {94056#true} [304] L93-2-->L97-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[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {94056#true} [306] L97-1-->L101-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[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {94056#true} [308] L101-1-->L105-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[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {94056#true} [310] L105-1-->L109-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[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {94056#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {94056#true} is VALID [2022-04-08 02:56:36,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {94056#true} [314] L113-1-->L117-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {94061#(= main_~p7~0 0)} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {94061#(= main_~p7~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {94061#(= main_~p7~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {94061#(= main_~p7~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {94061#(= main_~p7~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {94061#(= main_~p7~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {94061#(= main_~p7~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {94061#(= main_~p7~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {94061#(= main_~p7~0 0)} [332] L149-1-->L155-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {94061#(= main_~p7~0 0)} [336] L155-1-->L160-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {94061#(= main_~p7~0 0)} [342] L160-1-->L165-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {94061#(= main_~p7~0 0)} [346] L165-1-->L170-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {94061#(= main_~p7~0 0)} [350] L170-1-->L175-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[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {94061#(= main_~p7~0 0)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {94061#(= main_~p7~0 0)} is VALID [2022-04-08 02:56:36,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {94061#(= main_~p7~0 0)} [357] L180-1-->L186: Formula: (not (= v_main_~p7~0_4 0)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[] {94057#false} is VALID [2022-04-08 02:56:36,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {94057#false} [359] L186-->L226-1: Formula: (not (= v_main_~lk7~0_4 1)) InVars {main_~lk7~0=v_main_~lk7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_4} AuxVars[] AssignedVars[] {94057#false} is VALID [2022-04-08 02:56:36,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {94057#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94057#false} is VALID [2022-04-08 02:56:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673379335] [2022-04-08 02:56:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673379335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:36,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:36,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736356003] [2022-04-08 02:56:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:36,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:36,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:36,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:36,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:36,912 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:39,630 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-08 02:56:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-08 02:56:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 02:56:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-08 02:56:39,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-08 02:56:39,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:40,758 INFO L225 Difference]: With dead ends: 9677 [2022-04-08 02:56:40,758 INFO L226 Difference]: Without dead ends: 5643 [2022-04-08 02:56:40,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:40,762 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:40,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-08 02:56:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-08 02:56:40,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:40,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,861 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:40,867 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:41,731 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 02:56:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 02:56:41,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:41,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:41,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5643 states. [2022-04-08 02:56:41,750 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5643 states. [2022-04-08 02:56:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:42,619 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-08 02:56:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-08 02:56:42,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:42,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:42,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:42,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-08 02:56:43,501 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-08 02:56:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:43,502 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-08 02:56:43,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-08 02:56:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 02:56:43,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:43,504 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:43,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 02:56:43,504 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash -21626014, now seen corresponding path program 1 times [2022-04-08 02:56:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025002643] [2022-04-08 02:56:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:43,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {121012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {121006#true} is VALID [2022-04-08 02:56:43,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {121006#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121006#true} {121006#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {121006#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:43,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {121012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {121006#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121006#true} {121006#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {121006#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {121006#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {121006#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {121006#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {121006#true} [302] L93-->L93-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[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {121006#true} [304] L93-2-->L97-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[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {121006#true} [306] L97-1-->L101-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[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {121006#true} [308] L101-1-->L105-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[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {121006#true} [310] L105-1-->L109-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[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {121006#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {121006#true} is VALID [2022-04-08 02:56:43,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {121006#true} [313] L113-1-->L117-1: Formula: (and (= v_main_~lk7~0_3 1) (not (= v_main_~p7~0_2 0))) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_3, main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[main_~lk7~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {121011#(not (= main_~p7~0 0))} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {121011#(not (= main_~p7~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {121011#(not (= main_~p7~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {121011#(not (= main_~p7~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {121011#(not (= main_~p7~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {121011#(not (= main_~p7~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {121011#(not (= main_~p7~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {121011#(not (= main_~p7~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {121011#(not (= main_~p7~0 0))} [332] L149-1-->L155-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[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {121011#(not (= main_~p7~0 0))} [336] L155-1-->L160-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[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {121011#(not (= main_~p7~0 0))} [342] L160-1-->L165-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[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {121011#(not (= main_~p7~0 0))} [346] L165-1-->L170-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[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {121011#(not (= main_~p7~0 0))} [350] L170-1-->L175-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[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {121011#(not (= main_~p7~0 0))} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {121011#(not (= main_~p7~0 0))} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {121011#(not (= main_~p7~0 0))} [358] L180-1-->L185-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[] {121007#false} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {121007#false} [361] L185-1-->L191: Formula: (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} AuxVars[] AssignedVars[] {121007#false} is VALID [2022-04-08 02:56:43,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {121007#false} [363] L191-->L226-1: Formula: (not (= v_main_~lk8~0_4 1)) InVars {main_~lk8~0=v_main_~lk8~0_4} OutVars{main_~lk8~0=v_main_~lk8~0_4} AuxVars[] AssignedVars[] {121007#false} is VALID [2022-04-08 02:56:43,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {121007#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121007#false} is VALID [2022-04-08 02:56:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:43,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025002643] [2022-04-08 02:56:43,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025002643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:43,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:43,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192472057] [2022-04-08 02:56:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:56:43,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:43,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:43,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:43,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:43,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:43,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:43,557 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:45,813 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-08 02:56:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:56:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 02:56:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-08 02:56:45,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-08 02:56:45,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:46,858 INFO L225 Difference]: With dead ends: 8461 [2022-04-08 02:56:46,858 INFO L226 Difference]: Without dead ends: 5707 [2022-04-08 02:56:46,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:46,861 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:46,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-08 02:56:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-08 02:56:46,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:46,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:46,950 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:46,958 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:47,789 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 02:56:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 02:56:47,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:47,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:47,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5707 states. [2022-04-08 02:56:47,806 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 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 5707 states. [2022-04-08 02:56:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:48,716 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-08 02:56:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-08 02:56:48,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:48,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:48,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:56:48,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:56:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-08 02:56:49,639 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-08 02:56:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:56:49,640 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-08 02:56:49,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-08 02:56:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 02:56:49,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:56:49,643 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:56:49,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 02:56:49,643 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:56:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:56:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -866097885, now seen corresponding path program 1 times [2022-04-08 02:56:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:56:49,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759220194] [2022-04-08 02:56:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:56:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:56:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:56:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:56:49,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {146938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {146932#true} is VALID [2022-04-08 02:56:49,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {146932#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146932#true} {146932#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {146932#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:56:49,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {146938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {146932#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146932#true} {146932#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {146932#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {146932#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {146932#true} is VALID [2022-04-08 02:56:49,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {146932#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {146932#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {146932#true} [302] L93-->L93-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {146932#true} [304] L93-2-->L97-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {146932#true} [306] L97-1-->L101-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {146932#true} [308] L101-1-->L105-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {146932#true} [310] L105-1-->L109-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {146932#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {146932#true} [314] L113-1-->L117-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[] {146932#true} is VALID [2022-04-08 02:56:49,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {146932#true} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {146937#(= main_~lk8~0 1)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {146937#(= main_~lk8~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {146937#(= main_~lk8~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {146937#(= main_~lk8~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {146937#(= main_~lk8~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {146937#(= main_~lk8~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {146937#(= main_~lk8~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {146937#(= main_~lk8~0 1)} [332] L149-1-->L155-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {146937#(= main_~lk8~0 1)} [336] L155-1-->L160-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {146937#(= main_~lk8~0 1)} [342] L160-1-->L165-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {146937#(= main_~lk8~0 1)} [346] L165-1-->L170-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {146937#(= main_~lk8~0 1)} [350] L170-1-->L175-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {146937#(= main_~lk8~0 1)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {146937#(= main_~lk8~0 1)} [358] L180-1-->L185-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[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {146937#(= main_~lk8~0 1)} [361] L185-1-->L191: Formula: (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} AuxVars[] AssignedVars[] {146937#(= main_~lk8~0 1)} is VALID [2022-04-08 02:56:49,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {146937#(= main_~lk8~0 1)} [363] L191-->L226-1: Formula: (not (= v_main_~lk8~0_4 1)) InVars {main_~lk8~0=v_main_~lk8~0_4} OutVars{main_~lk8~0=v_main_~lk8~0_4} AuxVars[] AssignedVars[] {146933#false} is VALID [2022-04-08 02:56:49,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {146933#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146933#false} is VALID [2022-04-08 02:56:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:56:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:56:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759220194] [2022-04-08 02:56:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759220194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:56:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:56:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:56:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144520933] [2022-04-08 02:56:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:56:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:56:49,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:56:49,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:49,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:49,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:56:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:56:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:56:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:56:49,701 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:52,536 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-08 02:56:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:56:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:56:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:56:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 02:56:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 02:56:52,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 02:56:52,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:56:55,504 INFO L225 Difference]: With dead ends: 10253 [2022-04-08 02:56:55,505 INFO L226 Difference]: Without dead ends: 10251 [2022-04-08 02:56:55,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:56:55,506 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:56:55,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:56:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-08 02:56:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-08 02:56:55,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:56:55,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,621 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:55,631 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:56:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:56:58,164 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 02:56:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 02:56:58,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:56:58,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:56:58,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 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 10251 states. [2022-04-08 02:56:58,187 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 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 10251 states. [2022-04-08 02:57:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:00,977 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-08 02:57:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-08 02:57:00,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:00,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:00,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:00,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-08 02:57:03,032 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-08 02:57:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:03,032 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-08 02:57:03,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-08 02:57:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 02:57:03,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:03,036 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:03,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 02:57:03,037 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1863170238, now seen corresponding path program 1 times [2022-04-08 02:57:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839002727] [2022-04-08 02:57:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:03,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {186304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {186298#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186298#true} {186298#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {186298#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:03,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {186304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {186298#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186298#true} {186298#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {186298#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {186298#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {186298#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {186298#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {186298#true} [302] L93-->L93-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {186298#true} [304] L93-2-->L97-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {186298#true} [306] L97-1-->L101-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {186298#true} [308] L101-1-->L105-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {186298#true} [310] L105-1-->L109-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {186298#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {186298#true} [314] L113-1-->L117-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[] {186298#true} is VALID [2022-04-08 02:57:03,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {186298#true} [316] L117-1-->L121-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {186303#(= main_~p8~0 0)} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {186303#(= main_~p8~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {186303#(= main_~p8~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {186303#(= main_~p8~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {186303#(= main_~p8~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {186303#(= main_~p8~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {186303#(= main_~p8~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {186303#(= main_~p8~0 0)} [332] L149-1-->L155-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {186303#(= main_~p8~0 0)} [336] L155-1-->L160-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {186303#(= main_~p8~0 0)} [342] L160-1-->L165-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {186303#(= main_~p8~0 0)} [346] L165-1-->L170-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {186303#(= main_~p8~0 0)} [350] L170-1-->L175-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {186303#(= main_~p8~0 0)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {186303#(= main_~p8~0 0)} [358] L180-1-->L185-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[] {186303#(= main_~p8~0 0)} is VALID [2022-04-08 02:57:03,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {186303#(= main_~p8~0 0)} [361] L185-1-->L191: Formula: (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} AuxVars[] AssignedVars[] {186299#false} is VALID [2022-04-08 02:57:03,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {186299#false} [363] L191-->L226-1: Formula: (not (= v_main_~lk8~0_4 1)) InVars {main_~lk8~0=v_main_~lk8~0_4} OutVars{main_~lk8~0=v_main_~lk8~0_4} AuxVars[] AssignedVars[] {186299#false} is VALID [2022-04-08 02:57:03,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {186299#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186299#false} is VALID [2022-04-08 02:57:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:57:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839002727] [2022-04-08 02:57:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839002727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:03,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:03,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443967333] [2022-04-08 02:57:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:57:03,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:03,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:03,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:03,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:03,106 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:14,352 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-08 02:57:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 02:57:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 02:57:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-08 02:57:14,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-08 02:57:14,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:18,002 INFO L225 Difference]: With dead ends: 19213 [2022-04-08 02:57:18,003 INFO L226 Difference]: Without dead ends: 11147 [2022-04-08 02:57:18,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:18,009 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:18,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-08 02:57:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-08 02:57:18,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:18,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:18,144 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:18,157 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:21,103 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 02:57:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 02:57:21,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:21,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:21,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 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 11147 states. [2022-04-08 02:57:21,132 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 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 11147 states. [2022-04-08 02:57:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:24,475 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-08 02:57:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-08 02:57:24,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:24,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:24,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:24,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-08 02:57:27,740 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-08 02:57:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:27,741 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-08 02:57:27,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-08 02:57:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:57:27,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:27,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:27,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 02:57:27,747 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1079197679, now seen corresponding path program 1 times [2022-04-08 02:57:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:27,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593535906] [2022-04-08 02:57:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:27,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {239622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {239616#true} is VALID [2022-04-08 02:57:27,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {239616#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239616#true} {239616#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {239616#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:27,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {239622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {239616#true} is VALID [2022-04-08 02:57:27,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {239616#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239616#true} {239616#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {239616#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {239616#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {239616#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {239616#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {239616#true} [302] L93-->L93-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[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {239616#true} [304] L93-2-->L97-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[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {239616#true} [306] L97-1-->L101-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[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {239616#true} [308] L101-1-->L105-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[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {239616#true} [310] L105-1-->L109-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[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {239616#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {239616#true} is VALID [2022-04-08 02:57:27,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {239616#true} [314] L113-1-->L117-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[] {239616#true} is VALID [2022-04-08 02:57:27,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {239616#true} [315] L117-1-->L121-1: Formula: (and (not (= v_main_~p8~0_2 0)) (= v_main_~lk8~0_3 1)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2, main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[main_~lk8~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {239621#(not (= main_~p8~0 0))} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {239621#(not (= main_~p8~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {239621#(not (= main_~p8~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {239621#(not (= main_~p8~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {239621#(not (= main_~p8~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {239621#(not (= main_~p8~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {239621#(not (= main_~p8~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {239621#(not (= main_~p8~0 0))} [332] L149-1-->L155-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {239621#(not (= main_~p8~0 0))} [336] L155-1-->L160-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {239621#(not (= main_~p8~0 0))} [342] L160-1-->L165-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {239621#(not (= main_~p8~0 0))} [346] L165-1-->L170-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {239621#(not (= main_~p8~0 0))} [350] L170-1-->L175-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {239621#(not (= main_~p8~0 0))} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {239621#(not (= main_~p8~0 0))} [358] L180-1-->L185-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[] {239621#(not (= main_~p8~0 0))} is VALID [2022-04-08 02:57:27,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {239621#(not (= main_~p8~0 0))} [362] L185-1-->L190-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[] {239617#false} is VALID [2022-04-08 02:57:27,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {239617#false} [365] L190-1-->L196: Formula: (not (= v_main_~p9~0_4 0)) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[] {239617#false} is VALID [2022-04-08 02:57:27,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {239617#false} [367] L196-->L226-1: Formula: (not (= v_main_~lk9~0_4 1)) InVars {main_~lk9~0=v_main_~lk9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_4} AuxVars[] AssignedVars[] {239617#false} is VALID [2022-04-08 02:57:27,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {239617#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239617#false} is VALID [2022-04-08 02:57:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:57:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:27,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593535906] [2022-04-08 02:57:27,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593535906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:27,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:27,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:27,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693209239] [2022-04-08 02:57:27,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 02:57:27,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:27,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:27,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:27,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:27,816 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:35,568 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-08 02:57:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:57:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 02:57:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:57:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 02:57:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-08 02:57:35,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-08 02:57:35,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:39,281 INFO L225 Difference]: With dead ends: 16717 [2022-04-08 02:57:39,281 INFO L226 Difference]: Without dead ends: 11275 [2022-04-08 02:57:39,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:57:39,285 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:57:39,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:57:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-08 02:57:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-08 02:57:39,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:57:39,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:39,478 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:39,487 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:42,678 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 02:57:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 02:57:42,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:42,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:42,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 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 11275 states. [2022-04-08 02:57:42,702 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 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 11275 states. [2022-04-08 02:57:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:57:45,924 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-08 02:57:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-08 02:57:45,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:57:45,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:57:45,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:57:45,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:57:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-08 02:57:49,380 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-08 02:57:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:57:49,380 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-08 02:57:49,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-08 02:57:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:57:49,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:57:49,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:57:49,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 02:57:49,384 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:57:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:57:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1923669550, now seen corresponding path program 1 times [2022-04-08 02:57:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:57:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574478] [2022-04-08 02:57:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:57:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:57:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:57:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:57:49,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {290828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {290822#true} is VALID [2022-04-08 02:57:49,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {290822#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {290822#true} {290822#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {290822#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:57:49,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {290828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {290822#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290822#true} {290822#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {290822#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {290822#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {290822#true} is VALID [2022-04-08 02:57:49,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {290822#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {290822#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {290822#true} [302] L93-->L93-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {290822#true} [304] L93-2-->L97-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {290822#true} [306] L97-1-->L101-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {290822#true} [308] L101-1-->L105-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {290822#true} [310] L105-1-->L109-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {290822#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {290822#true} [314] L113-1-->L117-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[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {290822#true} [316] L117-1-->L121-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {290822#true} is VALID [2022-04-08 02:57:49,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {290822#true} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {290827#(= main_~lk9~0 1)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {290827#(= main_~lk9~0 1)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {290827#(= main_~lk9~0 1)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {290827#(= main_~lk9~0 1)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {290827#(= main_~lk9~0 1)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {290827#(= main_~lk9~0 1)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {290827#(= main_~lk9~0 1)} [332] L149-1-->L155-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {290827#(= main_~lk9~0 1)} [336] L155-1-->L160-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {290827#(= main_~lk9~0 1)} [342] L160-1-->L165-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {290827#(= main_~lk9~0 1)} [346] L165-1-->L170-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {290827#(= main_~lk9~0 1)} [350] L170-1-->L175-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {290827#(= main_~lk9~0 1)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {290827#(= main_~lk9~0 1)} [358] L180-1-->L185-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {290827#(= main_~lk9~0 1)} [362] L185-1-->L190-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[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {290827#(= main_~lk9~0 1)} [365] L190-1-->L196: Formula: (not (= v_main_~p9~0_4 0)) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[] {290827#(= main_~lk9~0 1)} is VALID [2022-04-08 02:57:49,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {290827#(= main_~lk9~0 1)} [367] L196-->L226-1: Formula: (not (= v_main_~lk9~0_4 1)) InVars {main_~lk9~0=v_main_~lk9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_4} AuxVars[] AssignedVars[] {290823#false} is VALID [2022-04-08 02:57:49,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {290823#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290823#false} is VALID [2022-04-08 02:57:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:57:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:57:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574478] [2022-04-08 02:57:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:57:49,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:57:49,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:57:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603874000] [2022-04-08 02:57:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:57:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 02:57:49,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:57:49,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:57:49,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:57:49,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:57:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:57:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:57:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:57:49,443 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:00,963 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-08 02:58:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:58:00,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 02:58:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:58:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 02:58:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 02:58:00,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 02:58:01,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:58:12,145 INFO L225 Difference]: With dead ends: 19981 [2022-04-08 02:58:12,145 INFO L226 Difference]: Without dead ends: 19979 [2022-04-08 02:58:12,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:58:12,147 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:58:12,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:58:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-08 02:58:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-08 02:58:12,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:58:12,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:12,351 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:12,372 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:24,373 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 02:58:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 02:58:24,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:58:24,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:58:24,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 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 19979 states. [2022-04-08 02:58:24,423 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 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 19979 states. [2022-04-08 02:58:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:58:39,402 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-08 02:58:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-08 02:58:39,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:58:39,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:58:39,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:58:39,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:58:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-08 02:58:46,920 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-08 02:58:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:58:46,920 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-08 02:58:46,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-08 02:58:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:58:46,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:58:46,931 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:58:46,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 02:58:46,931 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:58:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:58:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1374225393, now seen corresponding path program 1 times [2022-04-08 02:58:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:58:46,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921104664] [2022-04-08 02:58:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:58:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:58:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:58:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:58:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:58:46,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {367954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {367948#true} is VALID [2022-04-08 02:58:46,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {367948#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367948#true} {367948#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {367948#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:58:46,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {367954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {367948#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367948#true} {367948#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {367948#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {367948#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {367948#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {367948#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {367948#true} [302] L93-->L93-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[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {367948#true} [304] L93-2-->L97-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[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {367948#true} [306] L97-1-->L101-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[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {367948#true} [308] L101-1-->L105-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[] {367948#true} is VALID [2022-04-08 02:58:46,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {367948#true} [310] L105-1-->L109-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[] {367948#true} is VALID [2022-04-08 02:58:46,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {367948#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {367948#true} [314] L113-1-->L117-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[] {367948#true} is VALID [2022-04-08 02:58:46,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {367948#true} [316] L117-1-->L121-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {367948#true} is VALID [2022-04-08 02:58:46,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {367948#true} [318] L121-1-->L125-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {367953#(= main_~p9~0 0)} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {367953#(= main_~p9~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {367953#(= main_~p9~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {367953#(= main_~p9~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {367953#(= main_~p9~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {367953#(= main_~p9~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {367953#(= main_~p9~0 0)} [332] L149-1-->L155-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {367953#(= main_~p9~0 0)} [336] L155-1-->L160-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {367953#(= main_~p9~0 0)} [342] L160-1-->L165-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {367953#(= main_~p9~0 0)} [346] L165-1-->L170-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {367953#(= main_~p9~0 0)} [350] L170-1-->L175-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {367953#(= main_~p9~0 0)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {367953#(= main_~p9~0 0)} [358] L180-1-->L185-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {367953#(= main_~p9~0 0)} [362] L185-1-->L190-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[] {367953#(= main_~p9~0 0)} is VALID [2022-04-08 02:58:46,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {367953#(= main_~p9~0 0)} [365] L190-1-->L196: Formula: (not (= v_main_~p9~0_4 0)) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[] {367949#false} is VALID [2022-04-08 02:58:46,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {367949#false} [367] L196-->L226-1: Formula: (not (= v_main_~lk9~0_4 1)) InVars {main_~lk9~0=v_main_~lk9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_4} AuxVars[] AssignedVars[] {367949#false} is VALID [2022-04-08 02:58:46,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {367949#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367949#false} is VALID [2022-04-08 02:58:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:58:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:58:46,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921104664] [2022-04-08 02:58:46,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921104664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:58:46,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:58:46,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:58:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458344845] [2022-04-08 02:58:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:58:46,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 02:58:46,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:58:46,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:58:46,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:58:46,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:58:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:58:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:58:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:58:46,995 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:01:35,199 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-08 03:01:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:01:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-08 03:01:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:01:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 03:01:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-08 03:01:35,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-08 03:01:35,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:01:50,641 INFO L225 Difference]: With dead ends: 38157 [2022-04-08 03:01:50,642 INFO L226 Difference]: Without dead ends: 22027 [2022-04-08 03:01:50,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:01:50,654 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:01:50,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:01:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-08 03:01:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-08 03:01:50,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:01:50,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:50,994 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:01:51,020 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:02:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:02:02,710 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 03:02:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 03:02:02,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:02:02,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:02:02,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22027 states. [2022-04-08 03:02:02,809 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22027 states. [2022-04-08 03:02:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:02:17,624 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-08 03:02:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-08 03:02:17,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:02:17,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:02:17,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:02:17,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:02:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:02:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-08 03:02:32,346 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-08 03:02:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:02:32,346 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-08 03:02:32,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:02:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-08 03:02:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 03:02:32,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:02:32,355 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:02:32,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 03:02:32,355 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:02:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:02:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 495819198, now seen corresponding path program 1 times [2022-04-08 03:02:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:02:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558217288] [2022-04-08 03:02:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:02:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:02:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:02:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:02:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:02:32,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {473496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {473490#true} is VALID [2022-04-08 03:02:32,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {473490#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {473490#true} {473490#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {473490#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {473496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {473490#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {473490#true} {473490#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {473490#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {473490#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {473490#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {473490#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {473490#true} is VALID [2022-04-08 03:02:32,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {473490#true} [302] L93-->L93-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {473490#true} [304] L93-2-->L97-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {473490#true} [306] L97-1-->L101-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {473490#true} [308] L101-1-->L105-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {473490#true} [310] L105-1-->L109-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {473490#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {473490#true} [314] L113-1-->L117-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[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {473490#true} [316] L117-1-->L121-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {473490#true} is VALID [2022-04-08 03:02:32,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {473490#true} [317] L121-1-->L125-1: Formula: (and (not (= v_main_~p9~0_2 0)) (= v_main_~lk9~0_3 1)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~lk9~0=v_main_~lk9~0_3, main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[main_~lk9~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {473495#(not (= main_~p9~0 0))} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {473495#(not (= main_~p9~0 0))} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {473495#(not (= main_~p9~0 0))} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {473495#(not (= main_~p9~0 0))} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {473495#(not (= main_~p9~0 0))} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {473495#(not (= main_~p9~0 0))} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {473495#(not (= main_~p9~0 0))} [332] L149-1-->L155-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {473495#(not (= main_~p9~0 0))} [336] L155-1-->L160-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {473495#(not (= main_~p9~0 0))} [342] L160-1-->L165-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {473495#(not (= main_~p9~0 0))} [346] L165-1-->L170-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {473495#(not (= main_~p9~0 0))} [350] L170-1-->L175-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {473495#(not (= main_~p9~0 0))} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {473495#(not (= main_~p9~0 0))} [358] L180-1-->L185-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {473495#(not (= main_~p9~0 0))} [362] L185-1-->L190-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[] {473495#(not (= main_~p9~0 0))} is VALID [2022-04-08 03:02:32,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {473495#(not (= main_~p9~0 0))} [366] L190-1-->L195-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {473491#false} is VALID [2022-04-08 03:02:32,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {473491#false} [369] L195-1-->L201: Formula: (not (= v_main_~p10~0_4 0)) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[] {473491#false} is VALID [2022-04-08 03:02:32,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {473491#false} [371] L201-->L226-1: Formula: (not (= v_main_~lk10~0_4 1)) InVars {main_~lk10~0=v_main_~lk10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_4} AuxVars[] AssignedVars[] {473491#false} is VALID [2022-04-08 03:02:32,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {473491#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473491#false} is VALID [2022-04-08 03:02:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:02:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:02:32,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558217288] [2022-04-08 03:02:32,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558217288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:02:32,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:02:32,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:02:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766339978] [2022-04-08 03:02:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:02:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 03:02:32,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:02:32,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:02:32,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:02:32,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:02:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 03:02:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:02:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:02:32,448 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:03:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:03:50,225 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-08 03:03:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:03:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 03:03:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:03:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:03:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 03:03:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:03:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-08 03:03:50,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-08 03:03:50,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:04:05,810 INFO L225 Difference]: With dead ends: 33037 [2022-04-08 03:04:05,810 INFO L226 Difference]: Without dead ends: 22283 [2022-04-08 03:04:05,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:04:05,820 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:04:05,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:04:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-08 03:04:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-08 03:04:06,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:04:06,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:06,201 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:06,227 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:04:18,582 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 03:04:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 03:04:18,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:04:18,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:04:18,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22283 states. [2022-04-08 03:04:18,656 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 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 22283 states. [2022-04-08 03:04:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:04:32,091 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-08 03:04:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-08 03:04:32,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:04:32,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:04:32,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:04:32,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:04:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-08 03:04:47,301 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-08 03:04:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:04:47,301 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-08 03:04:47,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-08 03:04:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 03:04:47,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:04:47,323 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:04:47,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 03:04:47,323 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:04:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:04:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -348652673, now seen corresponding path program 1 times [2022-04-08 03:04:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:04:47,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081028469] [2022-04-08 03:04:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:04:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:04:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:04:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:04:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:04:47,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {574686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {574680#true} is VALID [2022-04-08 03:04:47,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {574680#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574680#true} {574680#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {574680#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {574686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [290] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |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] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {574680#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574680#true} {574680#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {574680#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {574680#true} [292] mainENTRY-->L225-1: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (= |v_main_#t~nondet18_2| v_main_~p15~0_1) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (<= |v_main_#t~nondet18_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648)) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet18=|v_main_#t~nondet18_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~lk14~0=v_main_~lk14~0_4, main_~lk15~0=v_main_~lk15~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~p15~0=v_main_~p15~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~lk15~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~p15~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet18, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {574680#true} [296] L225-1-->L58: Formula: (and (<= 0 (+ |v_main_#t~nondet19_2| 2147483648)) (= |v_main_#t~nondet19_2| v_main_~cond~0_2) (<= |v_main_#t~nondet19_2| 2147483647)) InVars {main_#t~nondet19=|v_main_#t~nondet19_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet19, main_~cond~0] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {574680#true} [299] L58-->L93: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk15~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk14~0_5 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_5, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk15~0=v_main_~lk15~0_5, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk15~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {574680#true} is VALID [2022-04-08 03:04:47,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {574680#true} [302] L93-->L93-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {574680#true} [304] L93-2-->L97-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {574680#true} [306] L97-1-->L101-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {574680#true} [308] L101-1-->L105-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {574680#true} [310] L105-1-->L109-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {574680#true} [312] L109-1-->L113-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {574680#true} [314] L113-1-->L117-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[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {574680#true} [316] L117-1-->L121-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {574680#true} [318] L121-1-->L125-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {574680#true} is VALID [2022-04-08 03:04:47,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {574680#true} [320] L125-1-->L129-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {574685#(= main_~p10~0 0)} [321] L129-1-->L133-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {574685#(= main_~p10~0 0)} [323] L133-1-->L137-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {574685#(= main_~p10~0 0)} [325] L137-1-->L141-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {574685#(= main_~p10~0 0)} [327] L141-1-->L145-1: Formula: (and (not (= v_main_~p14~0_4 0)) (= v_main_~lk14~0_6 1)) InVars {main_~p14~0=v_main_~p14~0_4} OutVars{main_~p14~0=v_main_~p14~0_4, main_~lk14~0=v_main_~lk14~0_6} AuxVars[] AssignedVars[main_~lk14~0] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {574685#(= main_~p10~0 0)} [329] L145-1-->L149-1: Formula: (and (= v_main_~lk15~0_6 1) (not (= v_main_~p15~0_4 0))) InVars {main_~p15~0=v_main_~p15~0_4} OutVars{main_~lk15~0=v_main_~lk15~0_6, main_~p15~0=v_main_~p15~0_4} AuxVars[] AssignedVars[main_~lk15~0] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {574685#(= main_~p10~0 0)} [332] L149-1-->L155-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {574685#(= main_~p10~0 0)} [336] L155-1-->L160-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {574685#(= main_~p10~0 0)} [342] L160-1-->L165-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {574685#(= main_~p10~0 0)} [346] L165-1-->L170-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {574685#(= main_~p10~0 0)} [350] L170-1-->L175-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {574685#(= main_~p10~0 0)} [354] L175-1-->L180-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {574685#(= main_~p10~0 0)} [358] L180-1-->L185-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {574685#(= main_~p10~0 0)} [362] L185-1-->L190-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[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {574685#(= main_~p10~0 0)} [366] L190-1-->L195-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {574685#(= main_~p10~0 0)} is VALID [2022-04-08 03:04:47,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {574685#(= main_~p10~0 0)} [369] L195-1-->L201: Formula: (not (= v_main_~p10~0_4 0)) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[] {574681#false} is VALID [2022-04-08 03:04:47,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {574681#false} [371] L201-->L226-1: Formula: (not (= v_main_~lk10~0_4 1)) InVars {main_~lk10~0=v_main_~lk10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_4} AuxVars[] AssignedVars[] {574681#false} is VALID [2022-04-08 03:04:47,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {574681#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574681#false} is VALID [2022-04-08 03:04:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:04:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:04:47,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081028469] [2022-04-08 03:04:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081028469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:04:47,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:04:47,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:04:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052699996] [2022-04-08 03:04:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:04:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2022-04-08 03:04:47,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:04:47,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:04:47,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:04:47,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:04:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 03:04:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:04:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:04:47,380 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)