/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:20:31,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:20:31,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:20:31,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:20:31,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:20:31,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:20:31,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:20:31,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:20:31,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:20:31,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:20:31,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:20:31,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:20:31,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:20:31,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:20:31,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:20:31,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:20:31,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:20:31,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:20:31,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:20:31,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:20:31,401 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:20:31,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:20:31,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:20:31,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:20:31,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:20:31,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:20:31,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:20:31,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:20:31,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:20:31,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:20:31,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:20:31,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:20:31,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:20:31,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:20:31,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:20:31,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:20:31,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:20:31,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:20:31,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:20:31,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:20:31,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:20:31,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:20:31,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:20:31,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:20:31,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:20:31,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:20:31,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:20:31,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:20:31,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:20:31,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:20:31,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:20:31,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:20:31,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:20:31,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:20:31,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:20:31,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:31,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:20:31,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:20:31,429 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:20:31,429 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-07 21:20:31,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:20:31,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:20:31,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:20:31,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:20:31,647 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:20:31,648 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-07 21:20:31,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71b6fe29/bdd6883f68cd4600b3814e13ba2da41a/FLAG90b23ccae [2022-04-07 21:20:32,067 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:20:32,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-07 21:20:32,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71b6fe29/bdd6883f68cd4600b3814e13ba2da41a/FLAG90b23ccae [2022-04-07 21:20:32,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71b6fe29/bdd6883f68cd4600b3814e13ba2da41a [2022-04-07 21:20:32,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:20:32,084 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:20:32,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:32,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:20:32,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:20:32,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c8ba60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32, skipping insertion in model container [2022-04-07 21:20:32,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:20:32,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:20:32,246 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-07 21:20:32,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:32,254 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:20:32,275 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-07 21:20:32,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:32,288 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:20:32,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32 WrapperNode [2022-04-07 21:20:32,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:32,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:20:32,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:20:32,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:20:32,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:20:32,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:20:32,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:20:32,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:20:32,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:32,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:20:32,370 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-07 21:20:32,378 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-07 21:20:32,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:20:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:20:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:20:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:20:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:20:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:20:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:20:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:20:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:20:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:20:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:20:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:20:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:20:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:20:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:20:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:20:32,487 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:20:32,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:20:32,732 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:20:32,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:20:32,738 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:20:32,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:32 BoogieIcfgContainer [2022-04-07 21:20:32,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:20:32,740 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:20:32,740 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:20:32,741 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:20:32,746 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:32" (1/1) ... [2022-04-07 21:20:32,748 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:20:32,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:32 BasicIcfg [2022-04-07 21:20:32,781 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:20:32,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:20:32,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:20:32,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:20:32,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:20:32" (1/4) ... [2022-04-07 21:20:32,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ccb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:32, skipping insertion in model container [2022-04-07 21:20:32,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:32" (2/4) ... [2022-04-07 21:20:32,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ccb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:32, skipping insertion in model container [2022-04-07 21:20:32,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:32" (3/4) ... [2022-04-07 21:20:32,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4ccb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:32, skipping insertion in model container [2022-04-07 21:20:32,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:32" (4/4) ... [2022-04-07 21:20:32,786 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.cJordan [2022-04-07 21:20:32,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:20:32,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:20:32,827 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:20:32,831 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-07 21:20:32,831 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:20:32,845 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-07 21:20:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:32,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:32,851 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-07 21:20:32,852 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 539653987, now seen corresponding path program 1 times [2022-04-07 21:20:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:32,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958362367] [2022-04-07 21:20:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:33,040 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-07 21:20:33,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-07 21:20:33,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-07 21:20:33,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-07 21:20:33,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-07 21:20:33,043 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-07 21:20:33,043 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-07 21:20:33,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#true} is VALID [2022-04-07 21:20:33,044 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-07 21:20:33,044 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-07 21:20:33,044 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-07 21:20:33,048 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-07 21:20:33,049 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-07 21:20:33,049 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-07 21:20:33,050 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-07 21:20:33,050 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-07 21:20:33,051 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-07 21:20:33,051 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-07 21:20:33,052 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-07 21:20:33,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-07 21:20:33,053 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-07 21:20:33,054 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-07 21:20:33,054 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-07 21:20:33,055 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-07 21:20:33,055 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-07 21:20:33,055 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-07 21:20:33,056 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-07 21:20:33,056 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-07 21:20:33,056 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-07 21:20:33,057 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-07 21:20:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958362367] [2022-04-07 21:20:33,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958362367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:33,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:33,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518734189] [2022-04-07 21:20:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:33,065 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-07 21:20:33,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:33,068 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-07 21:20:33,103 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-07 21:20:33,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:33,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:33,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-07 21:20:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:33,414 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2022-04-07 21:20:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:33,415 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-07 21:20:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:33,416 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-07 21:20:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-07 21:20:33,424 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-07 21:20:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-07 21:20:33,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-07 21:20:33,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:33,599 INFO L225 Difference]: With dead ends: 111 [2022-04-07 21:20:33,599 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 21:20:33,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:33,603 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-07 21:20:33,604 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-07 21:20:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 21:20:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-07 21:20:33,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:33,625 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-07 21:20:33,626 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-07 21:20:33,626 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-07 21:20:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:33,631 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-07 21:20:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-07 21:20:33,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:33,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:33,632 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-07 21:20:33,633 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-07 21:20:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:33,637 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-07 21:20:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-07 21:20:33,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:33,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:33,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:33,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:33,638 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-07 21:20:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-07 21:20:33,641 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-07 21:20:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:33,641 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-07 21:20:33,641 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-07 21:20:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-07 21:20:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 21:20:33,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:33,642 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-07 21:20:33,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:20:33,642 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -457418366, now seen corresponding path program 1 times [2022-04-07 21:20:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:33,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398661261] [2022-04-07 21:20:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:33,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#(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] {463#true} is VALID [2022-04-07 21:20:33,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:33,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:33,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:33,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#(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] {463#true} is VALID [2022-04-07 21:20:33,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:33,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:33,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#true} is VALID [2022-04-07 21:20:33,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#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] {463#true} is VALID [2022-04-07 21:20:33,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#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] {463#true} is VALID [2022-04-07 21:20:33,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#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] {463#true} is VALID [2022-04-07 21:20:33,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#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[] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(= 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[] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {468#(= 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[] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(= 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] {468#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:33,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {468#(= 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[] {464#false} is VALID [2022-04-07 21:20:33,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {464#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[] {464#false} is VALID [2022-04-07 21:20:33,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {464#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#false} is VALID [2022-04-07 21:20:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:33,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:33,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398661261] [2022-04-07 21:20:33,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398661261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:33,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:33,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107667426] [2022-04-07 21:20:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:33,740 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-07 21:20:33,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:33,740 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-07 21:20:33,758 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-07 21:20:33,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:33,759 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-07 21:20:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:33,980 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-07 21:20:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:33,980 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-07 21:20:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:33,981 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-07 21:20:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-07 21:20:33,983 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-07 21:20:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-07 21:20:33,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-07 21:20:34,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:34,113 INFO L225 Difference]: With dead ends: 103 [2022-04-07 21:20:34,113 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 21:20:34,116 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-07 21:20:34,118 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-07 21:20:34,118 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-07 21:20:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 21:20:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-07 21:20:34,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:34,130 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-07 21:20:34,130 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-07 21:20:34,131 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-07 21:20:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,134 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-07 21:20:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-07 21:20:34,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:34,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:34,135 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-07 21:20:34,135 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-07 21:20:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,138 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-07 21:20:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-07 21:20:34,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:34,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:34,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:34,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:34,140 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-07 21:20:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-07 21:20:34,142 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-07 21:20:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:34,142 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-07 21:20:34,143 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-07 21:20:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-07 21:20:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 21:20:34,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:34,143 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-07 21:20:34,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:20:34,143 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -450563475, now seen corresponding path program 1 times [2022-04-07 21:20:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595034297] [2022-04-07 21:20:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {891#(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] {885#true} is VALID [2022-04-07 21:20:34,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-07 21:20:34,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-07 21:20:34,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:34,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {891#(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] {885#true} is VALID [2022-04-07 21:20:34,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-07 21:20:34,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-07 21:20:34,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-07 21:20:34,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#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] {885#true} is VALID [2022-04-07 21:20:34,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#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] {885#true} is VALID [2022-04-07 21:20:34,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#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] {885#true} is VALID [2022-04-07 21:20:34,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {890#(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[] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {890#(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[] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {890#(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] {890#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:34,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {890#(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[] {886#false} is VALID [2022-04-07 21:20:34,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {886#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[] {886#false} is VALID [2022-04-07 21:20:34,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {886#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[] {886#false} is VALID [2022-04-07 21:20:34,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {886#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {886#false} is VALID [2022-04-07 21:20:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595034297] [2022-04-07 21:20:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595034297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95253512] [2022-04-07 21:20:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:34,235 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-07 21:20:34,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:34,235 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-07 21:20:34,251 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-07 21:20:34,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:34,252 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-07 21:20:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,466 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:34,466 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-07 21:20:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:34,466 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-07 21:20:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:34,468 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-07 21:20:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:34,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 188 transitions. [2022-04-07 21:20:34,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:34,591 INFO L225 Difference]: With dead ends: 106 [2022-04-07 21:20:34,591 INFO L226 Difference]: Without dead ends: 106 [2022-04-07 21:20:34,592 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-07 21:20:34,592 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:34,593 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.1s Time] [2022-04-07 21:20:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-07 21:20:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-07 21:20:34,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:34,596 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-07 21:20:34,596 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-07 21:20:34,597 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-07 21:20:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,600 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-07 21:20:34,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:34,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:34,601 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-07 21:20:34,601 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-07 21:20:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,604 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-07 21:20:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-07 21:20:34,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:34,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:34,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:34,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:34,604 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-07 21:20:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-07 21:20:34,607 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-07 21:20:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:34,607 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-07 21:20:34,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-07 21:20:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 21:20:34,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:34,608 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:34,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:20:34,608 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1295035346, now seen corresponding path program 1 times [2022-04-07 21:20:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:34,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739028883] [2022-04-07 21:20:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:34,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {1325#(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] {1319#true} is VALID [2022-04-07 21:20:34,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1319#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#true} is VALID [2022-04-07 21:20:34,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1319#true} {1319#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#true} is VALID [2022-04-07 21:20:34,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1319#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:34,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#(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] {1319#true} is VALID [2022-04-07 21:20:34,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1319#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#true} is VALID [2022-04-07 21:20:34,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1319#true} {1319#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#true} is VALID [2022-04-07 21:20:34,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {1319#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#true} is VALID [2022-04-07 21:20:34,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1319#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] {1319#true} is VALID [2022-04-07 21:20:34,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#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] {1319#true} is VALID [2022-04-07 21:20:34,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#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] {1319#true} is VALID [2022-04-07 21:20:34,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#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[] {1319#true} is VALID [2022-04-07 21:20:34,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1319#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[] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {1324#(= 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[] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {1324#(= 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] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {1324#(= 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[] {1324#(= main_~p2~0 0)} is VALID [2022-04-07 21:20:34,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {1324#(= 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[] {1320#false} is VALID [2022-04-07 21:20:34,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {1320#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[] {1320#false} is VALID [2022-04-07 21:20:34,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {1320#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1320#false} is VALID [2022-04-07 21:20:34,682 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-07 21:20:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:34,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739028883] [2022-04-07 21:20:34,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739028883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:34,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:34,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968576267] [2022-04-07 21:20:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:34,683 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-07 21:20:34,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:34,683 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-07 21:20:34,700 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-07 21:20:34,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:34,704 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-07 21:20:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:34,908 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-07 21:20:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:34,908 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-07 21:20:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:34,908 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-07 21:20:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:34,910 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-07 21:20:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-04-07 21:20:34,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 188 transitions. [2022-04-07 21:20:35,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,039 INFO L225 Difference]: With dead ends: 197 [2022-04-07 21:20:35,039 INFO L226 Difference]: Without dead ends: 197 [2022-04-07 21:20:35,040 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-07 21:20:35,046 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:35,047 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.1s Time] [2022-04-07 21:20:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-07 21:20:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-07 21:20:35,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,054 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-07 21:20:35,054 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-07 21:20:35,054 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-07 21:20:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,059 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-07 21:20:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-07 21:20:35,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,060 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-07 21:20:35,060 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-07 21:20:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,065 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-07 21:20:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-07 21:20:35,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,065 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-07 21:20:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-07 21:20:35,069 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-07 21:20:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,070 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-07 21:20:35,070 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-07 21:20:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-07 21:20:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 21:20:35,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,070 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-07 21:20:35,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:20:35,071 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -297962993, now seen corresponding path program 1 times [2022-04-07 21:20:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252114628] [2022-04-07 21:20:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {2123#(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] {2117#true} is VALID [2022-04-07 21:20:35,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2117#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2117#true} is VALID [2022-04-07 21:20:35,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2117#true} {2117#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2117#true} is VALID [2022-04-07 21:20:35,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {2117#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:35,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {2123#(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] {2117#true} is VALID [2022-04-07 21:20:35,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {2117#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2117#true} is VALID [2022-04-07 21:20:35,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {2117#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {2117#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] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {2117#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] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {2117#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] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {2117#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[] {2117#true} is VALID [2022-04-07 21:20:35,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {2117#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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {2122#(= 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[] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {2122#(= 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] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {2122#(= 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[] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {2122#(= 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[] {2122#(= main_~lk2~0 1)} is VALID [2022-04-07 21:20:35,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {2122#(= 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[] {2118#false} is VALID [2022-04-07 21:20:35,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {2118#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2118#false} is VALID [2022-04-07 21:20:35,149 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-07 21:20:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252114628] [2022-04-07 21:20:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252114628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:35,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:35,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000674937] [2022-04-07 21:20:35,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:35,150 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-07 21:20:35,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:35,150 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-07 21:20:35,165 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-07 21:20:35,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:35,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:35,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:35,166 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-07 21:20:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,393 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-07 21:20:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,394 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-07 21:20:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,394 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-07 21:20:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-07 21:20:35,396 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-07 21:20:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-07 21:20:35,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-07 21:20:35,519 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-07 21:20:35,523 INFO L225 Difference]: With dead ends: 253 [2022-04-07 21:20:35,523 INFO L226 Difference]: Without dead ends: 253 [2022-04-07 21:20:35,523 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-07 21:20:35,523 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-07 21:20:35,524 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-07 21:20:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-07 21:20:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-07 21:20:35,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,529 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-07 21:20:35,529 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-07 21:20:35,529 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-07 21:20:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,535 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-07 21:20:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-07 21:20:35,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,536 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-07 21:20:35,536 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-07 21:20:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,542 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-07 21:20:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-07 21:20:35,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,543 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-07 21:20:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-07 21:20:35,547 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-07 21:20:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,547 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-07 21:20:35,547 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-07 21:20:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-07 21:20:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 21:20:35,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,548 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-07 21:20:35,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 21:20:35,548 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1491357826, now seen corresponding path program 1 times [2022-04-07 21:20:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109481595] [2022-04-07 21:20:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:35,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#(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] {3083#true} is VALID [2022-04-07 21:20:35,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {3083#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3083#true} is VALID [2022-04-07 21:20:35,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3083#true} {3083#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3083#true} is VALID [2022-04-07 21:20:35,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {3083#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:35,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#(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] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {3083#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3083#true} {3083#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {3083#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {3083#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] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {3083#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] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {3083#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] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {3083#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[] {3083#true} is VALID [2022-04-07 21:20:35,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {3083#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[] {3083#true} is VALID [2022-04-07 21:20:35,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {3083#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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {3088#(= 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[] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {3088#(= 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] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {3088#(= 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[] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {3088#(= 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[] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {3088#(= 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[] {3088#(= main_~lk3~0 1)} is VALID [2022-04-07 21:20:35,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {3088#(= 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[] {3084#false} is VALID [2022-04-07 21:20:35,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {3084#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3084#false} is VALID [2022-04-07 21:20:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:35,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109481595] [2022-04-07 21:20:35,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109481595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:35,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:35,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:35,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562576953] [2022-04-07 21:20:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:35,595 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-07 21:20:35,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:35,595 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-07 21:20:35,614 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-07 21:20:35,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:35,615 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-07 21:20:35,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,812 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-07 21:20:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:35,812 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-07 21:20:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:35,812 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-07 21:20:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-04-07 21:20:35,814 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-07 21:20:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-04-07 21:20:35,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 182 transitions. [2022-04-07 21:20:35,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:35,934 INFO L225 Difference]: With dead ends: 369 [2022-04-07 21:20:35,934 INFO L226 Difference]: Without dead ends: 369 [2022-04-07 21:20:35,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:35,935 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-07 21:20:35,935 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-07 21:20:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-07 21:20:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-07 21:20:35,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:35,941 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-07 21:20:35,941 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-07 21:20:35,942 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-07 21:20:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,949 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-07 21:20:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-07 21:20:35,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,950 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-07 21:20:35,950 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-07 21:20:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:35,966 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-07 21:20:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-07 21:20:35,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:35,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:35,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:35,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:35,968 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-07 21:20:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-07 21:20:35,972 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-07 21:20:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:35,972 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-07 21:20:35,972 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-07 21:20:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-07 21:20:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 21:20:35,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:35,973 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-07 21:20:35,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 21:20:35,973 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1806537117, now seen corresponding path program 1 times [2022-04-07 21:20:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716773047] [2022-04-07 21:20:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {4471#(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] {4465#true} is VALID [2022-04-07 21:20:36,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4465#true} is VALID [2022-04-07 21:20:36,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4465#true} {4465#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {4465#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {4471#(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] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4465#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4465#true} {4465#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {4465#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {4465#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] {4465#true} is VALID [2022-04-07 21:20:36,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {4465#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] {4465#true} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {4465#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] {4465#true} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {4465#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[] {4465#true} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {4465#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[] {4465#true} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {4465#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[] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {4470#(= 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[] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {4470#(= 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] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {4470#(= 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[] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {4470#(= 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[] {4470#(= main_~p3~0 0)} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {4470#(= 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[] {4466#false} is VALID [2022-04-07 21:20:36,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {4466#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[] {4466#false} is VALID [2022-04-07 21:20:36,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {4466#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4466#false} is VALID [2022-04-07 21:20:36,040 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-07 21:20:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716773047] [2022-04-07 21:20:36,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716773047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904558826] [2022-04-07 21:20:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,041 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-07 21:20:36,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,041 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-07 21:20:36,054 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-07 21:20:36,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,055 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-07 21:20:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,246 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-07 21:20:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,246 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-07 21:20:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,247 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-07 21:20:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2022-04-07 21:20:36,248 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-07 21:20:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2022-04-07 21:20:36,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 185 transitions. [2022-04-07 21:20:36,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:36,392 INFO L225 Difference]: With dead ends: 377 [2022-04-07 21:20:36,392 INFO L226 Difference]: Without dead ends: 377 [2022-04-07 21:20:36,393 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-07 21:20:36,393 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-07 21:20:36,393 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-07 21:20:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-07 21:20:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-07 21:20:36,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,399 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-07 21:20:36,399 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-07 21:20:36,400 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-07 21:20:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,407 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-07 21:20:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-07 21:20:36,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,409 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-07 21:20:36,409 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-07 21:20:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,417 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-07 21:20:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-07 21:20:36,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,418 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-07 21:20:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-07 21:20:36,425 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-07 21:20:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,425 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-07 21:20:36,425 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-07 21:20:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-07 21:20:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 21:20:36,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,426 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-07 21:20:36,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 21:20:36,426 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1012580010, now seen corresponding path program 1 times [2022-04-07 21:20:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409463014] [2022-04-07 21:20:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {5989#(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] {5983#true} is VALID [2022-04-07 21:20:36,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {5983#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5983#true} is VALID [2022-04-07 21:20:36,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5983#true} {5983#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5983#true} is VALID [2022-04-07 21:20:36,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {5983#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {5989#(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] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {5983#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5983#true} {5983#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {5983#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {5983#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] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {5983#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] {5983#true} is VALID [2022-04-07 21:20:36,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {5983#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] {5983#true} is VALID [2022-04-07 21:20:36,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#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[] {5983#true} is VALID [2022-04-07 21:20:36,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#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[] {5983#true} is VALID [2022-04-07 21:20:36,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {5983#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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {5988#(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[] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {5988#(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] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {5988#(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[] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {5988#(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[] {5988#(not (= main_~p3~0 0))} is VALID [2022-04-07 21:20:36,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {5988#(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[] {5984#false} is VALID [2022-04-07 21:20:36,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {5984#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[] {5984#false} is VALID [2022-04-07 21:20:36,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {5984#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[] {5984#false} is VALID [2022-04-07 21:20:36,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {5984#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5984#false} is VALID [2022-04-07 21:20:36,466 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-07 21:20:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409463014] [2022-04-07 21:20:36,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409463014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945219669] [2022-04-07 21:20:36,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,467 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-07 21:20:36,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,467 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-07 21:20:36,481 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-07 21:20:36,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,482 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-07 21:20:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,681 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-07 21:20:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:36,681 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-07 21:20:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:36,681 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-07 21:20:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-07 21:20:36,683 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-07 21:20:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-07 21:20:36,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-07 21:20:36,796 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-07 21:20:36,801 INFO L225 Difference]: With dead ends: 383 [2022-04-07 21:20:36,801 INFO L226 Difference]: Without dead ends: 383 [2022-04-07 21:20:36,802 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-07 21:20:36,802 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:36,802 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.0s Time] [2022-04-07 21:20:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-07 21:20:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-07 21:20:36,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:36,807 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-07 21:20:36,808 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-07 21:20:36,808 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-07 21:20:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,815 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-07 21:20:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-07 21:20:36,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,817 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-07 21:20:36,817 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-07 21:20:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:36,824 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-07 21:20:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-07 21:20:36,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:36,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:36,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:36,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:36,825 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-07 21:20:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-07 21:20:36,831 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-07 21:20:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:36,831 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-07 21:20:36,831 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-07 21:20:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-07 21:20:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 21:20:36,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:36,832 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-07 21:20:36,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 21:20:36,832 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash 168108139, now seen corresponding path program 1 times [2022-04-07 21:20:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:36,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350954782] [2022-04-07 21:20:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:36,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {7531#(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] {7525#true} is VALID [2022-04-07 21:20:36,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {7525#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7525#true} is VALID [2022-04-07 21:20:36,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7525#true} {7525#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {7525#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {7531#(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] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {7525#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7525#true} {7525#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {7525#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {7525#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] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {7525#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] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {7525#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] {7525#true} is VALID [2022-04-07 21:20:36,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {7525#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[] {7525#true} is VALID [2022-04-07 21:20:36,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {7525#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[] {7525#true} is VALID [2022-04-07 21:20:36,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {7525#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[] {7525#true} is VALID [2022-04-07 21:20:36,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {7525#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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {7530#(= 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[] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {7530#(= 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] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {7530#(= 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[] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {7530#(= 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[] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {7530#(= 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[] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {7530#(= 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[] {7530#(= main_~lk4~0 1)} is VALID [2022-04-07 21:20:36,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {7530#(= 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[] {7526#false} is VALID [2022-04-07 21:20:36,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {7526#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7526#false} is VALID [2022-04-07 21:20:36,906 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-07 21:20:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:36,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350954782] [2022-04-07 21:20:36,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350954782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:36,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:36,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339291644] [2022-04-07 21:20:36,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:36,907 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-07 21:20:36,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:36,908 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-07 21:20:36,921 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-07 21:20:36,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:36,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:36,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:36,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:36,922 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-07 21:20:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,118 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-07 21:20:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,118 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-07 21:20:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,119 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-07 21:20:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:37,120 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-07 21:20:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:37,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-07 21:20:37,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:37,241 INFO L225 Difference]: With dead ends: 715 [2022-04-07 21:20:37,241 INFO L226 Difference]: Without dead ends: 715 [2022-04-07 21:20:37,241 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-07 21:20:37,242 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-07 21:20:37,242 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-07 21:20:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-07 21:20:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-07 21:20:37,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,249 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-07 21:20:37,250 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-07 21:20:37,250 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-07 21:20:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,292 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-07 21:20:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-07 21:20:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,294 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-07 21:20:37,295 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-07 21:20:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,311 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-07 21:20:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-07 21:20:37,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,312 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-07 21:20:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-07 21:20:37,322 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-07 21:20:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,322 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-07 21:20:37,322 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-07 21:20:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-07 21:20:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 21:20:37,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,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] [2022-04-07 21:20:37,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 21:20:37,323 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -828964214, now seen corresponding path program 1 times [2022-04-07 21:20:37,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446615445] [2022-04-07 21:20:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {10209#(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] {10203#true} is VALID [2022-04-07 21:20:37,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {10203#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10203#true} is VALID [2022-04-07 21:20:37,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10203#true} {10203#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {10203#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {10209#(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] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {10203#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10203#true} {10203#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {10203#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {10203#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] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {10203#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] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {10203#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] {10203#true} is VALID [2022-04-07 21:20:37,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {10203#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[] {10203#true} is VALID [2022-04-07 21:20:37,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {10203#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[] {10203#true} is VALID [2022-04-07 21:20:37,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {10203#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[] {10203#true} is VALID [2022-04-07 21:20:37,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {10203#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[] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {10208#(= 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[] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {10208#(= 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] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {10208#(= 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[] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {10208#(= 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[] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {10208#(= 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[] {10208#(= main_~p4~0 0)} is VALID [2022-04-07 21:20:37,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {10208#(= 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[] {10204#false} is VALID [2022-04-07 21:20:37,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {10204#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[] {10204#false} is VALID [2022-04-07 21:20:37,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {10204#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10204#false} is VALID [2022-04-07 21:20:37,356 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-07 21:20:37,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446615445] [2022-04-07 21:20:37,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446615445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024812893] [2022-04-07 21:20:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,356 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-07 21:20:37,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,357 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-07 21:20:37,370 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-07 21:20:37,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,370 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-07 21:20:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,577 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-07 21:20:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:37,577 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-07 21:20:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:37,577 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-07 21:20:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-07 21:20:37,579 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-07 21:20:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-07 21:20:37,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-07 21:20:37,697 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-07 21:20:37,712 INFO L225 Difference]: With dead ends: 739 [2022-04-07 21:20:37,713 INFO L226 Difference]: Without dead ends: 739 [2022-04-07 21:20:37,713 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-07 21:20:37,713 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:37,714 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.0s Time] [2022-04-07 21:20:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-07 21:20:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-07 21:20:37,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:37,724 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-07 21:20:37,724 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-07 21:20:37,726 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-07 21:20:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,742 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-07 21:20:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-07 21:20:37,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,744 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-07 21:20:37,745 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-07 21:20:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:37,762 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-07 21:20:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-07 21:20:37,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:37,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:37,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:37,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:37,764 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-07 21:20:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-07 21:20:37,780 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-07 21:20:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:37,780 INFO L478 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-07 21:20:37,780 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-07 21:20:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-07 21:20:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 21:20:37,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:37,781 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-07 21:20:37,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 21:20:37,781 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 916417497, now seen corresponding path program 1 times [2022-04-07 21:20:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:37,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318702859] [2022-04-07 21:20:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:37,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {13175#(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] {13169#true} is VALID [2022-04-07 21:20:37,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {13169#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13169#true} is VALID [2022-04-07 21:20:37,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13169#true} {13169#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {13169#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {13175#(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] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {13169#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13169#true} {13169#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {13169#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {13169#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] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {13169#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] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {13169#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] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {13169#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[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {13169#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[] {13169#true} is VALID [2022-04-07 21:20:37,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {13169#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[] {13169#true} is VALID [2022-04-07 21:20:37,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {13169#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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {13174#(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[] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {13174#(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] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {13174#(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[] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {13174#(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[] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {13174#(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[] {13174#(not (= main_~p4~0 0))} is VALID [2022-04-07 21:20:37,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {13174#(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[] {13170#false} is VALID [2022-04-07 21:20:37,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {13170#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[] {13170#false} is VALID [2022-04-07 21:20:37,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {13170#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[] {13170#false} is VALID [2022-04-07 21:20:37,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {13170#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13170#false} is VALID [2022-04-07 21:20:37,838 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-07 21:20:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:37,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318702859] [2022-04-07 21:20:37,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318702859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:37,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:37,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020267428] [2022-04-07 21:20:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:37,839 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-07 21:20:37,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:37,839 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-07 21:20:37,854 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-07 21:20:37,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:37,856 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-07 21:20:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,071 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-07 21:20:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:38,071 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-07 21:20:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:38,071 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-07 21:20:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-04-07 21:20:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2022-04-07 21:20:38,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 182 transitions. [2022-04-07 21:20:38,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:38,213 INFO L225 Difference]: With dead ends: 747 [2022-04-07 21:20:38,213 INFO L226 Difference]: Without dead ends: 747 [2022-04-07 21:20:38,213 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-07 21:20:38,213 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-07 21:20:38,214 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-07 21:20:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-07 21:20:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-07 21:20:38,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:38,229 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-07 21:20:38,230 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-07 21:20:38,231 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-07 21:20:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,249 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-07 21:20:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-07 21:20:38,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:38,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:38,251 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-07 21:20:38,252 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-07 21:20:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,269 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-07 21:20:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-07 21:20:38,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:38,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:38,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:38,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:38,286 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-07 21:20:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-07 21:20:38,302 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-07 21:20:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:38,302 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-07 21:20:38,302 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-07 21:20:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-07 21:20:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 21:20:38,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:38,303 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-07 21:20:38,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 21:20:38,303 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash 71945626, now seen corresponding path program 1 times [2022-04-07 21:20:38,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:38,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316291239] [2022-04-07 21:20:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:38,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:38,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {16173#(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] {16167#true} is VALID [2022-04-07 21:20:38,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16167#true} is VALID [2022-04-07 21:20:38,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16167#true} {16167#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16167#true} is VALID [2022-04-07 21:20:38,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:38,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {16173#(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] {16167#true} is VALID [2022-04-07 21:20:38,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16167#true} is VALID [2022-04-07 21:20:38,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16167#true} is VALID [2022-04-07 21:20:38,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16167#true} is VALID [2022-04-07 21:20:38,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#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] {16167#true} is VALID [2022-04-07 21:20:38,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#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] {16167#true} is VALID [2022-04-07 21:20:38,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#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] {16167#true} is VALID [2022-04-07 21:20:38,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#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[] {16167#true} is VALID [2022-04-07 21:20:38,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#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[] {16167#true} is VALID [2022-04-07 21:20:38,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#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[] {16167#true} is VALID [2022-04-07 21:20:38,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#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[] {16167#true} is VALID [2022-04-07 21:20:38,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {16172#(= 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] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {16172#(= 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[] {16172#(= main_~lk5~0 1)} is VALID [2022-04-07 21:20:38,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {16172#(= 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[] {16168#false} is VALID [2022-04-07 21:20:38,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {16168#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16168#false} is VALID [2022-04-07 21:20:38,345 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-07 21:20:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316291239] [2022-04-07 21:20:38,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316291239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:38,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:38,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921839510] [2022-04-07 21:20:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:38,346 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-07 21:20:38,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:38,346 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-07 21:20:38,360 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-07 21:20:38,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:38,361 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-07 21:20:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,584 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-07 21:20:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:38,585 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-07 21:20:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:38,585 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-07 21:20:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-07 21:20:38,586 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-07 21:20:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-07 21:20:38,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-07 21:20:38,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:38,743 INFO L225 Difference]: With dead ends: 1387 [2022-04-07 21:20:38,743 INFO L226 Difference]: Without dead ends: 1387 [2022-04-07 21:20:38,743 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-07 21:20:38,743 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-07 21:20:38,744 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-07 21:20:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-07 21:20:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-07 21:20:38,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:38,756 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-07 21:20:38,757 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-07 21:20:38,758 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-07 21:20:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,811 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-07 21:20:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-07 21:20:38,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:38,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:38,814 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-07 21:20:38,815 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-07 21:20:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:38,869 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-07 21:20:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-07 21:20:38,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:38,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:38,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:38,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:38,872 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-07 21:20:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-07 21:20:38,903 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-07 21:20:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:38,903 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-07 21:20:38,904 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-07 21:20:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-07 21:20:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 21:20:38,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:38,905 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-07 21:20:38,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 21:20:38,905 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -925126727, now seen corresponding path program 1 times [2022-04-07 21:20:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:38,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189127171] [2022-04-07 21:20:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:38,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {21379#(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] {21373#true} is VALID [2022-04-07 21:20:38,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {21373#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21373#true} is VALID [2022-04-07 21:20:38,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21373#true} {21373#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {21373#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:38,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {21379#(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] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {21373#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21373#true} {21373#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {21373#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {21373#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] {21373#true} is VALID [2022-04-07 21:20:38,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {21373#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] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {21373#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] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {21373#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[] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {21373#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[] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {21373#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[] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {21373#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[] {21373#true} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {21373#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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {21378#(= 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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {21378#(= 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] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {21378#(= 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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {21378#(= 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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {21378#(= 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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {21378#(= 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[] {21378#(= main_~p5~0 0)} is VALID [2022-04-07 21:20:38,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {21378#(= 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[] {21374#false} is VALID [2022-04-07 21:20:38,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {21374#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[] {21374#false} is VALID [2022-04-07 21:20:38,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {21374#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21374#false} is VALID [2022-04-07 21:20:38,950 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-07 21:20:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189127171] [2022-04-07 21:20:38,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189127171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:38,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:38,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192601976] [2022-04-07 21:20:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:38,951 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-07 21:20:38,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:38,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:38,966 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-07 21:20:38,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:38,967 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-07 21:20:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:39,205 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-07 21:20:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:39,206 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-07 21:20:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:39,206 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-07 21:20:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-07 21:20:39,207 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-07 21:20:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-07 21:20:39,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-07 21:20:39,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:39,380 INFO L225 Difference]: With dead ends: 1451 [2022-04-07 21:20:39,381 INFO L226 Difference]: Without dead ends: 1451 [2022-04-07 21:20:39,381 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-07 21:20:39,381 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-07 21:20:39,381 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-07 21:20:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-07 21:20:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-07 21:20:39,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:39,417 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-07 21:20:39,418 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-07 21:20:39,419 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-07 21:20:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:39,473 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-07 21:20:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-07 21:20:39,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:39,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:39,476 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-07 21:20:39,477 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-07 21:20:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:39,530 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-07 21:20:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-07 21:20:39,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:39,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:39,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:39,534 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-07 21:20:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-07 21:20:39,587 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-07 21:20:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:39,587 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-07 21:20:39,587 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-07 21:20:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-07 21:20:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 21:20:39,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:39,588 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-07 21:20:39,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 21:20:39,588 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2064620282, now seen corresponding path program 1 times [2022-04-07 21:20:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:39,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76403663] [2022-04-07 21:20:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:39,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {27193#(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] {27187#true} is VALID [2022-04-07 21:20:39,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {27187#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27187#true} is VALID [2022-04-07 21:20:39,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27187#true} {27187#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27187#true} is VALID [2022-04-07 21:20:39,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {27187#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:39,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {27193#(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] {27187#true} is VALID [2022-04-07 21:20:39,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {27187#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27187#true} is VALID [2022-04-07 21:20:39,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27187#true} {27187#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27187#true} is VALID [2022-04-07 21:20:39,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {27187#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27187#true} is VALID [2022-04-07 21:20:39,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {27187#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] {27187#true} is VALID [2022-04-07 21:20:39,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {27187#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] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {27187#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] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {27187#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[] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {27187#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[] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {27187#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[] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {27187#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[] {27187#true} is VALID [2022-04-07 21:20:39,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {27187#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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {27192#(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[] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {27192#(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] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {27192#(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[] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {27192#(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[] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {27192#(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[] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {27192#(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[] {27192#(not (= main_~p5~0 0))} is VALID [2022-04-07 21:20:39,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {27192#(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[] {27188#false} is VALID [2022-04-07 21:20:39,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {27188#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[] {27188#false} is VALID [2022-04-07 21:20:39,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {27188#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[] {27188#false} is VALID [2022-04-07 21:20:39,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {27188#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27188#false} is VALID [2022-04-07 21:20:39,632 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-07 21:20:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76403663] [2022-04-07 21:20:39,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76403663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:39,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:39,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716742773] [2022-04-07 21:20:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:39,634 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-07 21:20:39,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:39,634 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-07 21:20:39,648 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-07 21:20:39,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:39,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:39,648 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-07 21:20:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:39,886 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-07 21:20:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:39,886 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-07 21:20:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:39,886 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-07 21:20:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-07 21:20:39,889 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-07 21:20:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-07 21:20:39,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-07 21:20:39,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:40,052 INFO L225 Difference]: With dead ends: 1467 [2022-04-07 21:20:40,052 INFO L226 Difference]: Without dead ends: 1467 [2022-04-07 21:20:40,052 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-07 21:20:40,053 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-07 21:20:40,053 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-07 21:20:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-07 21:20:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-07 21:20:40,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:40,069 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-07 21:20:40,070 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-07 21:20:40,071 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-07 21:20:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:40,121 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-07 21:20:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-07 21:20:40,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:40,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:40,125 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-07 21:20:40,126 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-07 21:20:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:40,177 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-07 21:20:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-07 21:20:40,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:40,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:40,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:40,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:40,181 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-07 21:20:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-07 21:20:40,232 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-07 21:20:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:40,232 INFO L478 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-07 21:20:40,232 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-07 21:20:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-07 21:20:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 21:20:40,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:40,233 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:40,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 21:20:40,234 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1385875143, now seen corresponding path program 1 times [2022-04-07 21:20:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:40,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172260901] [2022-04-07 21:20:40,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:40,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {33071#(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] {33065#true} is VALID [2022-04-07 21:20:40,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {33065#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33065#true} is VALID [2022-04-07 21:20:40,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33065#true} {33065#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {33065#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:40,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {33071#(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] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {33065#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33065#true} {33065#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {33065#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {33065#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] {33065#true} is VALID [2022-04-07 21:20:40,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {33065#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] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {33065#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] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {33065#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[] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {33065#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[] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {33065#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[] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {33065#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[] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {33065#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[] {33065#true} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {33065#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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {33070#(= 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] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {33070#(= 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[] {33070#(= main_~lk6~0 1)} is VALID [2022-04-07 21:20:40,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {33070#(= 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[] {33066#false} is VALID [2022-04-07 21:20:40,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {33066#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33066#false} is VALID [2022-04-07 21:20:40,273 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-07 21:20:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:40,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172260901] [2022-04-07 21:20:40,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172260901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:40,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:40,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414341967] [2022-04-07 21:20:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:40,274 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-07 21:20:40,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:40,274 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-07 21:20:40,288 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-07 21:20:40,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:40,289 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-07 21:20:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:40,661 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-07 21:20:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:40,661 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-07 21:20:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:40,661 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-07 21:20:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2022-04-07 21:20:40,663 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-07 21:20:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2022-04-07 21:20:40,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2022-04-07 21:20:40,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:40,981 INFO L225 Difference]: With dead ends: 2699 [2022-04-07 21:20:40,982 INFO L226 Difference]: Without dead ends: 2699 [2022-04-07 21:20:40,983 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-07 21:20:40,985 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-07 21:20:40,985 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-07 21:20:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-07 21:20:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-07 21:20:41,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:41,012 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-07 21:20:41,015 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-07 21:20:41,017 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-07 21:20:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:41,195 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-07 21:20:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-07 21:20:41,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:41,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:41,202 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-07 21:20:41,203 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-07 21:20:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:41,370 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-07 21:20:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-07 21:20:41,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:41,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:41,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:41,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:41,375 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-07 21:20:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-07 21:20:41,493 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-07 21:20:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:41,494 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-07 21:20:41,494 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-07 21:20:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-07 21:20:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 21:20:41,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:41,495 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-07 21:20:41,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 21:20:41,495 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 388802790, now seen corresponding path program 1 times [2022-04-07 21:20:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983495313] [2022-04-07 21:20:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:41,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {43237#(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] {43231#true} is VALID [2022-04-07 21:20:41,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {43231#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43231#true} is VALID [2022-04-07 21:20:41,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43231#true} {43231#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43231#true} is VALID [2022-04-07 21:20:41,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {43231#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:41,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {43237#(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] {43231#true} is VALID [2022-04-07 21:20:41,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {43231#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43231#true} is VALID [2022-04-07 21:20:41,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43231#true} {43231#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43231#true} is VALID [2022-04-07 21:20:41,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {43231#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {43231#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] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {43231#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] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {43231#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] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {43231#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[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {43231#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[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {43231#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[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {43231#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[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {43231#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[] {43231#true} is VALID [2022-04-07 21:20:41,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {43231#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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {43236#(= 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] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {43236#(= 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[] {43236#(= main_~p6~0 0)} is VALID [2022-04-07 21:20:41,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {43236#(= 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[] {43232#false} is VALID [2022-04-07 21:20:41,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {43232#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[] {43232#false} is VALID [2022-04-07 21:20:41,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {43232#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43232#false} is VALID [2022-04-07 21:20:41,548 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-07 21:20:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983495313] [2022-04-07 21:20:41,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983495313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:41,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:41,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690119073] [2022-04-07 21:20:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:41,550 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-07 21:20:41,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:41,550 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-07 21:20:41,564 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-07 21:20:41,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:41,565 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-07 21:20:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:41,926 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-07 21:20:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:41,927 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-07 21:20:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:41,927 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-07 21:20:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-07 21:20:41,928 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-07 21:20:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-07 21:20:41,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-07 21:20:42,038 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-07 21:20:42,239 INFO L225 Difference]: With dead ends: 2859 [2022-04-07 21:20:42,239 INFO L226 Difference]: Without dead ends: 2859 [2022-04-07 21:20:42,239 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-07 21:20:42,240 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-07 21:20:42,240 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-07 21:20:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-07 21:20:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-07 21:20:42,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:42,269 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-07 21:20:42,271 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-07 21:20:42,273 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-07 21:20:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:42,473 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-07 21:20:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-07 21:20:42,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:42,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:42,478 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-07 21:20:42,480 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-07 21:20:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:42,672 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-07 21:20:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-07 21:20:42,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:42,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:42,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:42,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:42,677 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-07 21:20:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-07 21:20:42,873 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-07 21:20:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:42,873 INFO L478 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-07 21:20:42,873 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-07 21:20:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-07 21:20:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 21:20:42,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:42,874 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-07 21:20:42,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 21:20:42,875 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 12489205, now seen corresponding path program 1 times [2022-04-07 21:20:42,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:42,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340644442] [2022-04-07 21:20:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:42,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {54683#(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] {54677#true} is VALID [2022-04-07 21:20:42,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {54677#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54677#true} is VALID [2022-04-07 21:20:42,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54677#true} {54677#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {54677#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {54683#(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] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {54677#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54677#true} {54677#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {54677#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {54677#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] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {54677#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] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {54677#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] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {54677#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[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {54677#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[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {54677#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[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {54677#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[] {54677#true} is VALID [2022-04-07 21:20:42,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {54677#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[] {54677#true} is VALID [2022-04-07 21:20:42,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {54677#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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {54682#(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] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {54682#(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[] {54682#(not (= main_~p6~0 0))} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {54682#(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[] {54678#false} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {54678#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[] {54678#false} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {54678#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[] {54678#false} is VALID [2022-04-07 21:20:42,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {54678#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54678#false} is VALID [2022-04-07 21:20:42,906 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-07 21:20:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:42,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340644442] [2022-04-07 21:20:42,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340644442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:42,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:42,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269679143] [2022-04-07 21:20:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:42,906 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-07 21:20:42,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:42,907 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-07 21:20:42,922 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-07 21:20:42,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:42,923 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-07 21:20:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:43,288 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-07 21:20:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:43,288 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-07 21:20:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:43,289 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-07 21:20:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:43,290 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-07 21:20:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:43,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-07 21:20:43,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:43,610 INFO L225 Difference]: With dead ends: 2891 [2022-04-07 21:20:43,610 INFO L226 Difference]: Without dead ends: 2891 [2022-04-07 21:20:43,611 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-07 21:20:43,611 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:43,611 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.0s Time] [2022-04-07 21:20:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-07 21:20:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-07 21:20:43,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:43,640 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-07 21:20:43,642 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-07 21:20:43,644 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-07 21:20:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:43,828 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-07 21:20:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-07 21:20:43,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:43,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:43,834 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-07 21:20:43,836 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-07 21:20:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:44,025 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-07 21:20:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-07 21:20:44,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:44,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:44,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:44,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:44,031 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-07 21:20:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-07 21:20:44,248 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-07 21:20:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:44,248 INFO L478 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-07 21:20:44,248 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-07 21:20:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-07 21:20:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 21:20:44,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:44,249 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-07 21:20:44,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 21:20:44,250 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash -831982666, now seen corresponding path program 1 times [2022-04-07 21:20:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:44,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712207635] [2022-04-07 21:20:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:44,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:44,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {66257#(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] {66251#true} is VALID [2022-04-07 21:20:44,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {66251#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66251#true} is VALID [2022-04-07 21:20:44,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66251#true} {66251#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66251#true} is VALID [2022-04-07 21:20:44,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {66251#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:44,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {66257#(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] {66251#true} is VALID [2022-04-07 21:20:44,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {66251#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66251#true} {66251#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {66251#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {66251#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] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {66251#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] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {66251#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] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {66251#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[] {66251#true} is VALID [2022-04-07 21:20:44,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {66251#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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {66256#(= 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] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {66256#(= 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[] {66256#(= main_~lk7~0 1)} is VALID [2022-04-07 21:20:44,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {66256#(= 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[] {66252#false} is VALID [2022-04-07 21:20:44,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {66252#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66252#false} is VALID [2022-04-07 21:20:44,283 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-07 21:20:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712207635] [2022-04-07 21:20:44,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712207635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:44,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:44,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244765930] [2022-04-07 21:20:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:44,284 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-07 21:20:44,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:44,284 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-07 21:20:44,300 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-07 21:20:44,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:44,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:44,301 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-07 21:20:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:45,161 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-07 21:20:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:45,161 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-07 21:20:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:45,161 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-07 21:20:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-07 21:20:45,162 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-07 21:20:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-07 21:20:45,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-07 21:20:45,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:46,022 INFO L225 Difference]: With dead ends: 5259 [2022-04-07 21:20:46,023 INFO L226 Difference]: Without dead ends: 5259 [2022-04-07 21:20:46,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:46,023 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-07 21:20:46,023 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-07 21:20:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-07 21:20:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-07 21:20:46,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:46,068 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-07 21:20:46,071 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-07 21:20:46,074 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-07 21:20:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:46,731 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-07 21:20:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-07 21:20:46,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:46,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:46,740 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-07 21:20:46,743 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-07 21:20:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:47,421 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-07 21:20:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-07 21:20:47,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:47,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:47,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:47,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:47,429 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-07 21:20:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-07 21:20:47,842 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-07 21:20:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:47,843 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-07 21:20:47,843 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-07 21:20:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-07 21:20:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 21:20:47,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:47,845 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-07 21:20:47,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 21:20:47,845 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1829055019, now seen corresponding path program 1 times [2022-04-07 21:20:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722003506] [2022-04-07 21:20:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:47,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {86151#(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] {86145#true} is VALID [2022-04-07 21:20:47,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {86145#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86145#true} is VALID [2022-04-07 21:20:47,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86145#true} {86145#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86145#true} is VALID [2022-04-07 21:20:47,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {86145#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:47,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {86151#(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] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {86145#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86145#true} {86145#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {86145#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {86145#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] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {86145#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] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {86145#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] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {86145#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[] {86145#true} is VALID [2022-04-07 21:20:47,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {86145#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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {86150#(= 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] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {86150#(= 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[] {86150#(= main_~p7~0 0)} is VALID [2022-04-07 21:20:47,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {86150#(= 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[] {86146#false} is VALID [2022-04-07 21:20:47,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {86146#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[] {86146#false} is VALID [2022-04-07 21:20:47,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {86146#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86146#false} is VALID [2022-04-07 21:20:47,878 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-07 21:20:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722003506] [2022-04-07 21:20:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722003506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:47,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:47,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128502252] [2022-04-07 21:20:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:47,879 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-07 21:20:47,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:47,880 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-07 21:20:47,894 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-07 21:20:47,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:47,895 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-07 21:20:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:48,852 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-07 21:20:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:48,852 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-07 21:20:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:48,852 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-07 21:20:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-07 21:20:48,853 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-07 21:20:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-07 21:20:48,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-07 21:20:48,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:49,858 INFO L225 Difference]: With dead ends: 5643 [2022-04-07 21:20:49,858 INFO L226 Difference]: Without dead ends: 5643 [2022-04-07 21:20:49,858 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-07 21:20:49,858 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-07 21:20:49,859 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-07 21:20:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-07 21:20:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-07 21:20:49,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:49,908 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-07 21:20:49,912 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-07 21:20:49,917 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-07 21:20:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:50,707 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-07 21:20:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-07 21:20:50,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:50,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:50,717 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-07 21:20:50,721 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-07 21:20:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:51,443 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-07 21:20:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-07 21:20:51,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:51,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:51,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:51,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:51,453 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-07 21:20:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-07 21:20:52,241 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-07 21:20:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:52,241 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-07 21:20:52,241 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-07 21:20:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-07 21:20:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 21:20:52,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:52,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, 1, 1, 1] [2022-04-07 21:20:52,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 21:20:52,244 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -21626014, now seen corresponding path program 1 times [2022-04-07 21:20:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43107794] [2022-04-07 21:20:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:52,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {108733#(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] {108727#true} is VALID [2022-04-07 21:20:52,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {108727#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108727#true} is VALID [2022-04-07 21:20:52,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108727#true} {108727#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108727#true} is VALID [2022-04-07 21:20:52,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {108727#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {108733#(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] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {108727#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108727#true} {108727#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {108727#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {108727#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] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {108727#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] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {108727#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] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {108727#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[] {108727#true} is VALID [2022-04-07 21:20:52,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {108727#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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {108732#(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] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {108732#(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[] {108732#(not (= main_~p7~0 0))} is VALID [2022-04-07 21:20:52,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {108732#(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[] {108728#false} is VALID [2022-04-07 21:20:52,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {108728#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[] {108728#false} is VALID [2022-04-07 21:20:52,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {108728#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[] {108728#false} is VALID [2022-04-07 21:20:52,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {108728#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108728#false} is VALID [2022-04-07 21:20:52,275 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-07 21:20:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:52,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43107794] [2022-04-07 21:20:52,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43107794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:52,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:52,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420766507] [2022-04-07 21:20:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:52,276 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-07 21:20:52,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:52,276 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-07 21:20:52,291 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-07 21:20:52,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:52,292 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-07 21:20:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:53,282 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-07 21:20:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:53,282 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-07 21:20:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:53,282 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-07 21:20:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-04-07 21:20:53,283 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-07 21:20:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-04-07 21:20:53,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 176 transitions. [2022-04-07 21:20:53,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:54,284 INFO L225 Difference]: With dead ends: 5707 [2022-04-07 21:20:54,285 INFO L226 Difference]: Without dead ends: 5707 [2022-04-07 21:20:54,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-07 21:20:54,285 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:54,285 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.0s Time] [2022-04-07 21:20:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-07 21:20:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-07 21:20:54,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:54,330 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-07 21:20:54,334 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-07 21:20:54,338 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-07 21:20:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,108 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-07 21:20:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-07 21:20:55,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:55,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:55,117 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-07 21:20:55,120 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-07 21:20:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:55,853 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-07 21:20:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-07 21:20:55,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:55,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:55,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:55,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:55,861 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-07 21:20:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-07 21:20:56,654 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-07 21:20:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:56,654 INFO L478 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-07 21:20:56,654 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-07 21:20:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-07 21:20:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 21:20:56,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:56,656 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-07 21:20:56,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 21:20:56,656 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:56,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -866097885, now seen corresponding path program 1 times [2022-04-07 21:20:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:56,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029259475] [2022-04-07 21:20:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:56,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {131571#(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] {131565#true} is VALID [2022-04-07 21:20:56,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {131565#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131565#true} is VALID [2022-04-07 21:20:56,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131565#true} {131565#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {131565#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {131571#(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] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {131565#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131565#true} {131565#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {131565#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {131565#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] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {131565#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] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {131565#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] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {131565#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[] {131565#true} is VALID [2022-04-07 21:20:56,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {131565#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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {131570#(= 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] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {131570#(= 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[] {131570#(= main_~lk8~0 1)} is VALID [2022-04-07 21:20:56,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {131570#(= 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[] {131566#false} is VALID [2022-04-07 21:20:56,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {131566#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131566#false} is VALID [2022-04-07 21:20:56,705 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-07 21:20:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:56,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029259475] [2022-04-07 21:20:56,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029259475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:56,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:56,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064757170] [2022-04-07 21:20:56,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:56,706 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-07 21:20:56,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:56,706 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-07 21:20:56,725 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-07 21:20:56,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:56,725 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-07 21:20:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:59,521 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-07 21:20:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:59,521 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-07 21:20:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:59,522 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-07 21:20:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-07 21:20:59,523 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-07 21:20:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-07 21:20:59,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-07 21:20:59,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:21:02,576 INFO L225 Difference]: With dead ends: 10251 [2022-04-07 21:21:02,576 INFO L226 Difference]: Without dead ends: 10251 [2022-04-07 21:21:02,577 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-07 21:21:02,577 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:21:02,577 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.0s Time] [2022-04-07 21:21:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-07 21:21:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-07 21:21:02,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:21:02,649 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-07 21:21:02,695 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-07 21:21:02,701 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-07 21:21:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:05,332 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-07 21:21:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-07 21:21:05,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:05,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:05,345 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-07 21:21:05,349 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-07 21:21:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:08,044 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-07 21:21:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-07 21:21:08,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:08,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:08,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:21:08,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:21:08,057 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-07 21:21:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-07 21:21:09,716 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-07 21:21:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:21:09,716 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-07 21:21:09,716 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-07 21:21:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-07 21:21:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 21:21:09,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:21:09,719 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-07 21:21:09,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 21:21:09,720 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:21:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:21:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1863170238, now seen corresponding path program 1 times [2022-04-07 21:21:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:21:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15187373] [2022-04-07 21:21:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:21:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:21:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:21:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:09,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {170537#(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] {170531#true} is VALID [2022-04-07 21:21:09,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {170531#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170531#true} is VALID [2022-04-07 21:21:09,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170531#true} {170531#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {170531#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {170537#(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] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {170531#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170531#true} {170531#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {170531#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {170531#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] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {170531#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] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {170531#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] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {170531#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[] {170531#true} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {170531#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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {170536#(= 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] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {170536#(= 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[] {170536#(= main_~p8~0 0)} is VALID [2022-04-07 21:21:09,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {170536#(= 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[] {170532#false} is VALID [2022-04-07 21:21:09,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {170532#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[] {170532#false} is VALID [2022-04-07 21:21:09,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {170532#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170532#false} is VALID [2022-04-07 21:21:09,752 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-07 21:21:09,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:21:09,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15187373] [2022-04-07 21:21:09,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15187373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:21:09,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:21:09,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:21:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750827876] [2022-04-07 21:21:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:21:09,753 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-07 21:21:09,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:21:09,753 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-07 21:21:09,769 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-07 21:21:09,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:21:09,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:21:09,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:21:09,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:21:09,769 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-07 21:21:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:12,764 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-07 21:21:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:21:12,764 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-07 21:21:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:21:12,764 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-07 21:21:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-07 21:21:12,766 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-07 21:21:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-07 21:21:12,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-07 21:21:12,868 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-07 21:21:16,040 INFO L225 Difference]: With dead ends: 11147 [2022-04-07 21:21:16,040 INFO L226 Difference]: Without dead ends: 11147 [2022-04-07 21:21:16,040 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-07 21:21:16,040 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-07 21:21:16,041 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-07 21:21:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-07 21:21:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-07 21:21:16,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:21:16,124 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-07 21:21:16,136 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-07 21:21:16,148 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-07 21:21:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:19,335 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-07 21:21:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-07 21:21:19,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:19,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:19,354 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-07 21:21:19,366 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-07 21:21:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:22,194 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-07 21:21:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-07 21:21:22,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:22,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:22,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:21:22,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:21:22,209 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-07 21:21:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-07 21:21:25,391 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-07 21:21:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:21:25,391 INFO L478 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-07 21:21:25,391 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-07 21:21:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-07 21:21:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 21:21:25,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:21:25,395 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-07 21:21:25,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 21:21:25,395 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:21:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:21:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1079197679, now seen corresponding path program 1 times [2022-04-07 21:21:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:21:25,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771149394] [2022-04-07 21:21:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:21:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:21:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:21:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:25,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {215135#(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] {215129#true} is VALID [2022-04-07 21:21:25,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {215129#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215129#true} is VALID [2022-04-07 21:21:25,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215129#true} {215129#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {215129#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:21:25,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {215135#(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] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {215129#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215129#true} {215129#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {215129#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {215129#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] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {215129#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] {215129#true} is VALID [2022-04-07 21:21:25,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {215129#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] {215129#true} is VALID [2022-04-07 21:21:25,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {215129#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[] {215129#true} is VALID [2022-04-07 21:21:25,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {215129#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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {215134#(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] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {215134#(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[] {215134#(not (= main_~p8~0 0))} is VALID [2022-04-07 21:21:25,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {215134#(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[] {215130#false} is VALID [2022-04-07 21:21:25,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {215130#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[] {215130#false} is VALID [2022-04-07 21:21:25,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {215130#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[] {215130#false} is VALID [2022-04-07 21:21:25,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {215130#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215130#false} is VALID [2022-04-07 21:21:25,455 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-07 21:21:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:21:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771149394] [2022-04-07 21:21:25,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771149394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:21:25,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:21:25,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:21:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105432285] [2022-04-07 21:21:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:21:25,456 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-07 21:21:25,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:21:25,456 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-07 21:21:25,471 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-07 21:21:25,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:21:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:21:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:21:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:21:25,472 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-07 21:21:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:28,713 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-07 21:21:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:21:28,713 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-07 21:21:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:21:28,713 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-07 21:21:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-07 21:21:28,714 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-07 21:21:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-07 21:21:28,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-07 21:21:28,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:21:32,320 INFO L225 Difference]: With dead ends: 11275 [2022-04-07 21:21:32,320 INFO L226 Difference]: Without dead ends: 11275 [2022-04-07 21:21:32,321 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-07 21:21:32,321 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-07 21:21:32,321 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-07 21:21:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-07 21:21:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-07 21:21:32,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:21:32,421 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-07 21:21:32,432 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-07 21:21:32,442 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-07 21:21:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:35,502 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-07 21:21:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-07 21:21:35,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:35,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:35,520 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-07 21:21:35,531 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-07 21:21:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:38,729 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-07 21:21:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-07 21:21:38,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:21:38,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:21:38,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:21:38,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:21:38,748 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-07 21:21:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-07 21:21:41,868 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-07 21:21:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:21:41,868 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-07 21:21:41,868 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-07 21:21:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-07 21:21:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 21:21:41,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:21:41,871 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-07 21:21:41,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-07 21:21:41,872 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:21:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:21:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1923669550, now seen corresponding path program 1 times [2022-04-07 21:21:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:21:41,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692291964] [2022-04-07 21:21:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:21:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:21:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:41,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:21:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:21:41,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {260245#(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] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {260239#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260239#true} {260239#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {260239#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:21:41,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {260245#(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] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {260239#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260239#true} {260239#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {260239#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {260239#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] {260239#true} is VALID [2022-04-07 21:21:41,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {260239#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] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {260239#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] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {260239#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[] {260239#true} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {260239#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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {260244#(= 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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {260244#(= 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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {260244#(= 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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {260244#(= 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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {260244#(= 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] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {260244#(= 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[] {260244#(= main_~lk9~0 1)} is VALID [2022-04-07 21:21:41,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {260244#(= 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[] {260240#false} is VALID [2022-04-07 21:21:41,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {260240#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260240#false} is VALID [2022-04-07 21:21:41,915 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-07 21:21:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:21:41,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692291964] [2022-04-07 21:21:41,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692291964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:21:41,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:21:41,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:21:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906301284] [2022-04-07 21:21:41,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:21:41,916 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-07 21:21:41,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:21:41,916 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-07 21:21:41,934 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-07 21:21:41,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:21:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:21:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:21:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:21:41,934 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-07 21:21:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:21:52,102 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-07 21:21:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:21:52,102 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-07 21:21:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:21:52,102 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-07 21:21:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-04-07 21:21:52,103 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-07 21:21:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-04-07 21:21:52,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2022-04-07 21:21:52,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:22:01,823 INFO L225 Difference]: With dead ends: 19979 [2022-04-07 21:22:01,824 INFO L226 Difference]: Without dead ends: 19979 [2022-04-07 21:22:01,824 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-07 21:22:01,824 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:22:01,824 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.0s Time] [2022-04-07 21:22:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-07 21:22:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-07 21:22:01,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:22:01,947 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-07 21:22:01,966 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-07 21:22:01,984 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-07 21:22:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:22:10,863 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-07 21:22:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-07 21:22:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:22:10,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:22:10,887 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-07 21:22:10,901 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-07 21:22:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:22:20,160 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-07 21:22:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-07 21:22:20,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:22:20,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:22:20,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:22:20,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:22:20,186 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-07 21:22:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-07 21:22:27,510 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-07 21:22:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:22:27,511 INFO L478 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-07 21:22:27,511 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-07 21:22:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-07 21:22:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 21:22:27,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:22:27,517 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-07 21:22:27,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-07 21:22:27,517 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:22:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:22:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1374225393, now seen corresponding path program 1 times [2022-04-07 21:22:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:22:27,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447375269] [2022-04-07 21:22:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:22:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:22:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:22:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:22:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:22:27,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {336587#(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] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {336581#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {336581#true} {336581#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {336581#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:22:27,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {336587#(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] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {336581#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336581#true} {336581#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {336581#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {336581#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] {336581#true} is VALID [2022-04-07 21:22:27,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {336581#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] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {336581#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] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {336581#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[] {336581#true} is VALID [2022-04-07 21:22:27,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {336581#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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {336586#(= 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] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {336586#(= 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] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {336586#(= 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] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {336586#(= 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] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {336586#(= 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] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {336586#(= 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[] {336586#(= main_~p9~0 0)} is VALID [2022-04-07 21:22:27,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {336586#(= 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[] {336582#false} is VALID [2022-04-07 21:22:27,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {336582#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[] {336582#false} is VALID [2022-04-07 21:22:27,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {336582#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336582#false} is VALID [2022-04-07 21:22:27,558 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-07 21:22:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:22:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447375269] [2022-04-07 21:22:27,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447375269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:22:27,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:22:27,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:22:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070775607] [2022-04-07 21:22:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:22:27,559 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-07 21:22:27,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:22:27,559 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-07 21:22:27,575 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-07 21:22:27,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:22:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:22:27,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:22:27,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:22:27,576 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-07 21:22:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:22:39,717 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-07 21:22:39,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:22:39,717 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-07 21:22:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:22:39,718 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-07 21:22:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-04-07 21:22:39,718 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-07 21:22:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-04-07 21:22:39,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-04-07 21:22:39,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:22:53,125 INFO L225 Difference]: With dead ends: 22027 [2022-04-07 21:22:53,125 INFO L226 Difference]: Without dead ends: 22027 [2022-04-07 21:22:53,125 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-07 21:22:53,126 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-07 21:22:53,126 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-07 21:22:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-07 21:22:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-07 21:22:53,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:22:53,331 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-07 21:22:53,350 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-07 21:22:53,369 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-07 21:23:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:23:04,960 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-07 21:23:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-07 21:23:04,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:23:04,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:23:04,990 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-07 21:23:05,006 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-07 21:23:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:23:17,438 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-07 21:23:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-07 21:23:17,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:23:17,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:23:17,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:23:17,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:23:17,472 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-07 21:23:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-07 21:23:28,455 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-07 21:23:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:23:28,455 INFO L478 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-07 21:23:28,455 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-07 21:23:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-07 21:23:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 21:23:28,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:23:28,463 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-07 21:23:28,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-07 21:23:28,463 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:23:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:23:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash 495819198, now seen corresponding path program 1 times [2022-04-07 21:23:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:23:28,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107419317] [2022-04-07 21:23:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:23:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:23:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:23:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:23:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:23:28,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {424705#(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] {424699#true} is VALID [2022-04-07 21:23:28,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {424699#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424699#true} is VALID [2022-04-07 21:23:28,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {424699#true} {424699#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424699#true} is VALID [2022-04-07 21:23:28,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {424699#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:23:28,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {424705#(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] {424699#true} is VALID [2022-04-07 21:23:28,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {424699#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424699#true} is VALID [2022-04-07 21:23:28,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {424699#true} {424699#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424699#true} is VALID [2022-04-07 21:23:28,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {424699#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424699#true} is VALID [2022-04-07 21:23:28,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {424699#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] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {424699#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] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {424699#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] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {424699#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[] {424699#true} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {424699#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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {424704#(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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {424704#(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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {424704#(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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {424704#(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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {424704#(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] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {424704#(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[] {424704#(not (= main_~p9~0 0))} is VALID [2022-04-07 21:23:28,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {424704#(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[] {424700#false} is VALID [2022-04-07 21:23:28,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {424700#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[] {424700#false} is VALID [2022-04-07 21:23:28,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {424700#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[] {424700#false} is VALID [2022-04-07 21:23:28,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {424700#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424700#false} is VALID [2022-04-07 21:23:28,517 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-07 21:23:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:23:28,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107419317] [2022-04-07 21:23:28,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107419317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:23:28,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:23:28,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:23:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922090524] [2022-04-07 21:23:28,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:23:28,518 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-07 21:23:28,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:23:28,518 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-07 21:23:28,537 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-07 21:23:28,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:23:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:23:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:23:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:23:28,538 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-07 21:23:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:23:40,734 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-07 21:23:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:23:40,734 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-07 21:23:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:23:40,734 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-07 21:23:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-07 21:23:40,735 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-07 21:23:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-07 21:23:40,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-07 21:23:40,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:23:54,053 INFO L225 Difference]: With dead ends: 22283 [2022-04-07 21:23:54,053 INFO L226 Difference]: Without dead ends: 22283 [2022-04-07 21:23:54,053 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-07 21:23:54,053 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-07 21:23:54,054 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-07 21:23:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-07 21:23:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-07 21:23:54,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:23:54,226 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-07 21:23:54,250 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-07 21:23:54,274 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-07 21:24:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:24:05,251 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-07 21:24:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-07 21:24:05,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:24:05,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:24:05,281 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-07 21:24:05,300 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-07 21:24:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:24:16,989 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-07 21:24:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-07 21:24:17,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:24:17,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:24:17,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:24:17,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:24:17,019 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-07 21:24:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-07 21:24:29,901 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-07 21:24:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:24:29,901 INFO L478 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-07 21:24:29,901 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-07 21:24:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-07 21:24:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 21:24:29,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:24:29,908 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-07 21:24:29,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-07 21:24:29,908 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:24:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:24:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -348652673, now seen corresponding path program 1 times [2022-04-07 21:24:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:24:29,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515206869] [2022-04-07 21:24:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:24:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:24:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:24:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:24:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:24:29,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {513847#(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] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {513841#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {513841#true} {513841#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {513841#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:24:29,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {513847#(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] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {513841#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513841#true} {513841#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513841#true} is VALID [2022-04-07 21:24:29,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {513841#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {513841#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] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {513841#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] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {513841#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] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {513841#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[] {513841#true} is VALID [2022-04-07 21:24:29,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {513841#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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {513846#(= 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] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {513846#(= 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] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {513846#(= 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] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {513846#(= 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] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {513846#(= 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] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {513846#(= 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[] {513846#(= main_~p10~0 0)} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {513846#(= 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[] {513842#false} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {513842#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[] {513842#false} is VALID [2022-04-07 21:24:29,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {513842#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {513842#false} is VALID [2022-04-07 21:24:29,961 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-07 21:24:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:24:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515206869] [2022-04-07 21:24:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515206869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:24:29,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:24:29,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:24:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252287095] [2022-04-07 21:24:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:24:29,961 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-07 21:24:29,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:24:29,962 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-07 21:24:29,979 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-07 21:24:29,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:24:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:24:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:24:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:24:29,980 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) [2022-04-07 21:25:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:25:27,796 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2022-04-07 21:25:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:25:27,796 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-07 21:25:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:25:27,797 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-07 21:25:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-07 21:25:27,797 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-07 21:25:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-07 21:25:27,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-07 21:25:27,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:26:25,765 INFO L225 Difference]: With dead ends: 43531 [2022-04-07 21:26:25,765 INFO L226 Difference]: Without dead ends: 43531 [2022-04-07 21:26:25,766 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-07 21:26:25,766 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 117 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:26:25,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 117 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:26:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43531 states. [2022-04-07 21:26:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43531 to 43529. [2022-04-07 21:26:26,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:26:26,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:26:26,203 INFO L74 IsIncluded]: Start isIncluded. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:26:26,240 INFO L87 Difference]: Start difference. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:27:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:27:26,505 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2022-04-07 21:27:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43531 states and 61960 transitions. [2022-04-07 21:27:26,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:27:26,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:27:26,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 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 43531 states. [2022-04-07 21:27:26,622 INFO L87 Difference]: Start difference. First operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 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 43531 states. [2022-04-07 21:28:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:28:28,124 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2022-04-07 21:28:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43531 states and 61960 transitions. [2022-04-07 21:28:28,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:28:28,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:28:28,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:28:28,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:28:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:31:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43529 states to 43529 states and 61959 transitions. [2022-04-07 21:31:18,329 INFO L78 Accepts]: Start accepts. Automaton has 43529 states and 61959 transitions. Word has length 35 [2022-04-07 21:31:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:31:18,329 INFO L478 AbstractCegarLoop]: Abstraction has 43529 states and 61959 transitions. [2022-04-07 21:31:18,329 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-07 21:31:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 43529 states and 61959 transitions. [2022-04-07 21:31:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 21:31:18,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:31:18,344 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-07 21:31:18,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-07 21:31:18,345 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:31:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:31:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash 648419680, now seen corresponding path program 1 times [2022-04-07 21:31:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:31:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081870947] [2022-04-07 21:31:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:31:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:31:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:31:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:31:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:31:18,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {687981#(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] {687975#true} is VALID [2022-04-07 21:31:18,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {687975#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687975#true} is VALID [2022-04-07 21:31:18,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {687975#true} {687975#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {687975#true} [288] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {687981#(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] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {687975#true} [293] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687975#true} {687975#true} [393] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {687975#true} [289] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {687975#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] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {687975#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] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {687975#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] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {687975#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[] {687975#true} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {687975#true} [319] L125-1-->L129-1: Formula: (and (not (= v_main_~p10~0_2 0)) (= v_main_~lk10~0_3 1)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~lk10~0=v_main_~lk10~0_3, main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[main_~lk10~0] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {687980#(= main_~lk10~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] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {687980#(= main_~lk10~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] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {687980#(= main_~lk10~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] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {687980#(= main_~lk10~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] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {687980#(= main_~lk10~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] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {687980#(= main_~lk10~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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {687980#(= main_~lk10~0 1)} [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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {687980#(= main_~lk10~0 1)} [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[] {687980#(= main_~lk10~0 1)} is VALID [2022-04-07 21:31:18,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {687980#(= main_~lk10~0 1)} [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[] {687976#false} is VALID [2022-04-07 21:31:18,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {687976#false} [337] L226-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687976#false} is VALID [2022-04-07 21:31:18,380 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-07 21:31:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:31:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081870947] [2022-04-07 21:31:18,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081870947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:31:18,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:31:18,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:31:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888139723] [2022-04-07 21:31:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:31:18,381 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-07 21:31:18,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:31:18,381 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-07 21:31:18,399 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-07 21:31:18,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:31:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:31:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:31:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:31:18,400 INFO L87 Difference]: Start difference. First operand 43529 states and 61959 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-07 21:33:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:33:00,017 INFO L93 Difference]: Finished difference Result 49675 states and 72712 transitions. [2022-04-07 21:33:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:33:00,018 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-07 21:33:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:33:00,018 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-07 21:33:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-07 21:33:00,019 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-07 21:33:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-07 21:33:00,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-07 21:33:00,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:34:03,869 INFO L225 Difference]: With dead ends: 49675 [2022-04-07 21:34:03,870 INFO L226 Difference]: Without dead ends: 49675 [2022-04-07 21:34:03,870 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-07 21:34:03,870 INFO L913 BasicCegarLoop]: 149 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 156 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-07 21:34:03,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 156 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:34:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49675 states. [2022-04-07 21:34:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49675 to 43529. [2022-04-07 21:34:04,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:34:04,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49675 states. Second operand has 43529 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:34:04,292 INFO L74 IsIncluded]: Start isIncluded. First operand 49675 states. Second operand has 43529 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:34:04,336 INFO L87 Difference]: Start difference. First operand 49675 states. Second operand has 43529 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)