/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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:29:20,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:29:20,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:29:20,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:29:20,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:29:20,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:29:20,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:29:20,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:29:20,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:29:20,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:29:20,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:29:20,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:29:20,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:29:20,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:29:20,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:29:20,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:29:20,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:29:20,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:29:20,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:29:20,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:29:20,333 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:29:20,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:29:20,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:29:20,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:29:20,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:29:20,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:29:20,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:29:20,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:29:20,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:29:20,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:29:20,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:29:20,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:29:20,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:29:20,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:29:20,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:29:20,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:29:20,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:29:20,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:29:20,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:29:20,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:29:20,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:29:20,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:29:20,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:29:20,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:29:20,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:29:20,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:29:20,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:29:20,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:29:20,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:29:20,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:29:20,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:29:20,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:29:20,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:29:20,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:29:20,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:29:20,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:29:20,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:29:20,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:29:20,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:29:20,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:29:20,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:29:20,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:29:20,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:29:20,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:29:20,366 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:29:20,366 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-14 23:29:20,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:29:20,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:29:20,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:29:20,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:29:20,640 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:29:20,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-14 23:29:20,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852de86ab/6b3092da691e49fabfa0941ecfabcf71/FLAG68a885b28 [2022-04-14 23:29:21,073 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:29:21,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-14 23:29:21,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852de86ab/6b3092da691e49fabfa0941ecfabcf71/FLAG68a885b28 [2022-04-14 23:29:21,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852de86ab/6b3092da691e49fabfa0941ecfabcf71 [2022-04-14 23:29:21,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:29:21,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:29:21,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:29:21,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:29:21,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:29:21,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dbe111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21, skipping insertion in model container [2022-04-14 23:29:21,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:29:21,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:29:21,684 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_9.c[3555,3568] [2022-04-14 23:29:21,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:29:21,693 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:29:21,712 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_9.c[3555,3568] [2022-04-14 23:29:21,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:29:21,724 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:29:21,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21 WrapperNode [2022-04-14 23:29:21,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:29:21,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:29:21,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:29:21,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:29:21,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:29:21,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:29:21,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:29:21,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:29:21,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (1/1) ... [2022-04-14 23:29:21,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:29:21,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:29:21,807 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-14 23:29:21,830 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-14 23:29:21,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:29:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:29:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:29:21,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:29:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:29:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:29:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:29:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:29:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:29:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:29:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:29:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:29:21,939 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:29:21,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:29:22,168 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:29:22,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:29:22,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:29:22,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:29:22 BoogieIcfgContainer [2022-04-14 23:29:22,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:29:22,176 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:29:22,176 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:29:22,176 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:29:22,179 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:29:22" (1/1) ... [2022-04-14 23:29:22,181 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:29:22,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:29:22 BasicIcfg [2022-04-14 23:29:22,223 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:29:22,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:29:22,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:29:22,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:29:22,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:29:21" (1/4) ... [2022-04-14 23:29:22,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78197a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:29:22, skipping insertion in model container [2022-04-14 23:29:22,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:29:21" (2/4) ... [2022-04-14 23:29:22,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78197a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:29:22, skipping insertion in model container [2022-04-14 23:29:22,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:29:22" (3/4) ... [2022-04-14 23:29:22,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78197a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:29:22, skipping insertion in model container [2022-04-14 23:29:22,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:29:22" (4/4) ... [2022-04-14 23:29:22,229 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.cJordan [2022-04-14 23:29:22,237 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:29:22,237 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:29:22,265 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:29:22,270 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-14 23:29:22,270 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:29:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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-14 23:29:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 23:29:22,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:22,290 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:22,291 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash -311393162, now seen corresponding path program 1 times [2022-04-14 23:29:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126355954] [2022-04-14 23:29:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:22,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {45#true} is VALID [2022-04-14 23:29:22,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-14 23:29:22,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {45#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-14 23:29:22,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {45#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:22,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {45#true} is VALID [2022-04-14 23:29:22,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-14 23:29:22,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-14 23:29:22,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {45#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#true} is VALID [2022-04-14 23:29:22,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {45#true} is VALID [2022-04-14 23:29:22,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {45#true} is VALID [2022-04-14 23:29:22,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {45#true} is VALID [2022-04-14 23:29:22,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#true} [199] L63-->L63-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {50#(= main_~lk1~0 1)} [201] L63-2-->L67-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {50#(= main_~lk1~0 1)} [203] L67-1-->L71-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {50#(= main_~lk1~0 1)} [205] L71-1-->L75-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] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {50#(= main_~lk1~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(= main_~lk1~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {50#(= main_~lk1~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {50#(= main_~lk1~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {50#(= main_~lk1~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {50#(= main_~lk1~0 1)} [217] L95-1-->L102: 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[] {50#(= main_~lk1~0 1)} is VALID [2022-04-14 23:29:22,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#(= main_~lk1~0 1)} [219] L102-->L142-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[] {46#false} is VALID [2022-04-14 23:29:22,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {46#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#false} is VALID [2022-04-14 23:29:22,598 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-14 23:29:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126355954] [2022-04-14 23:29:22,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126355954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:22,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:22,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462225757] [2022-04-14 23:29:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 23:29:22,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:22,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:22,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:22,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:22,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:22,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:22,692 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,016 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2022-04-14 23:29:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 23:29:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-14 23:29:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-14 23:29:23,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-14 23:29:23,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:23,196 INFO L225 Difference]: With dead ends: 75 [2022-04-14 23:29:23,196 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 23:29:23,198 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-14 23:29:23,200 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:23,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:29:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 23:29:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-14 23:29:23,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:23,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,228 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,229 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,234 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-14 23:29:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-14 23:29:23,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:23,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:23,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-14 23:29:23,236 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-14 23:29:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,241 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2022-04-14 23:29:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2022-04-14 23:29:23,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:23,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:23,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:23,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-14 23:29:23,246 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-14 23:29:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:23,246 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-14 23:29:23,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-14 23:29:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 23:29:23,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:23,248 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:23,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:29:23,248 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash -182310443, now seen corresponding path program 1 times [2022-04-14 23:29:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:23,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773277603] [2022-04-14 23:29:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:23,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {313#true} is VALID [2022-04-14 23:29:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-14 23:29:23,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-14 23:29:23,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:23,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {313#true} is VALID [2022-04-14 23:29:23,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-14 23:29:23,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-14 23:29:23,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {313#true} is VALID [2022-04-14 23:29:23,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {313#true} is VALID [2022-04-14 23:29:23,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {313#true} is VALID [2022-04-14 23:29:23,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {313#true} is VALID [2022-04-14 23:29:23,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} [200] L63-->L63-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(= main_~p1~0 0)} [201] L63-2-->L67-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(= main_~p1~0 0)} [203] L67-1-->L71-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#(= main_~p1~0 0)} [205] L71-1-->L75-1: Formula: (and (= v_main_~lk4~0_3 1) (not (= v_main_~p4~0_2 0))) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#(= main_~p1~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#(= main_~p1~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#(= main_~p1~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {318#(= main_~p1~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {318#(= main_~p1~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {318#(= main_~p1~0 0)} is VALID [2022-04-14 23:29:23,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {318#(= main_~p1~0 0)} [217] L95-1-->L102: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-14 23:29:23,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#false} [219] L102-->L142-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-14 23:29:23,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {314#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#false} is VALID [2022-04-14 23:29:23,364 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-14 23:29:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773277603] [2022-04-14 23:29:23,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773277603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:23,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:23,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870850656] [2022-04-14 23:29:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 23:29:23,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:23,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:23,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:23,385 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,561 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-14 23:29:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 23:29:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-14 23:29:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-14 23:29:23,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-14 23:29:23,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:23,671 INFO L225 Difference]: With dead ends: 67 [2022-04-14 23:29:23,671 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 23:29:23,672 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-14 23:29:23,673 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:23,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:29:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 23:29:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-14 23:29:23,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:23,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,679 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,680 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,683 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-14 23:29:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-14 23:29:23,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:23,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:23,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-14 23:29:23,684 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-14 23:29:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,687 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-04-14 23:29:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2022-04-14 23:29:23,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:23,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:23,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:23,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-14 23:29:23,690 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-14 23:29:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:23,691 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-14 23:29:23,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-14 23:29:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:29:23,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:23,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:23,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:29:23,692 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1063221432, now seen corresponding path program 1 times [2022-04-14 23:29:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:23,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545162125] [2022-04-14 23:29:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:23,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {591#true} is VALID [2022-04-14 23:29:23,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#true} is VALID [2022-04-14 23:29:23,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {591#true} {591#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#true} is VALID [2022-04-14 23:29:23,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {591#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:23,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {591#true} is VALID [2022-04-14 23:29:23,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#true} is VALID [2022-04-14 23:29:23,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {591#true} {591#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#true} is VALID [2022-04-14 23:29:23,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {591#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {591#true} is VALID [2022-04-14 23:29:23,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {591#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {591#true} is VALID [2022-04-14 23:29:23,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {591#true} is VALID [2022-04-14 23:29:23,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {591#true} is VALID [2022-04-14 23:29:23,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#true} [199] L63-->L63-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] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#(not (= main_~p1~0 0))} [201] L63-2-->L67-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] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#(not (= main_~p1~0 0))} [203] L67-1-->L71-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] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#(not (= main_~p1~0 0))} [205] L71-1-->L75-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] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(not (= main_~p1~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#(not (= main_~p1~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#(not (= main_~p1~0 0))} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#(not (= main_~p1~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#(not (= main_~p1~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {596#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:29:23,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {596#(not (= main_~p1~0 0))} [218] L95-1-->L101-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[] {592#false} is VALID [2022-04-14 23:29:23,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {592#false} [221] L101-1-->L107: 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[] {592#false} is VALID [2022-04-14 23:29:23,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#false} [225] L107-->L142-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[] {592#false} is VALID [2022-04-14 23:29:23,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {592#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#false} is VALID [2022-04-14 23:29:23,758 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-14 23:29:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:23,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545162125] [2022-04-14 23:29:23,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545162125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:23,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:23,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397340082] [2022-04-14 23:29:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:23,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:23,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:23,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:23,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:23,777 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,930 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-14 23:29:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-14 23:29:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-14 23:29:23,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2022-04-14 23:29:24,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:24,025 INFO L225 Difference]: With dead ends: 70 [2022-04-14 23:29:24,025 INFO L226 Difference]: Without dead ends: 70 [2022-04-14 23:29:24,026 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-14 23:29:24,027 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:24,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:24,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-14 23:29:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-14 23:29:24,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:24,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,032 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,033 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,035 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-14 23:29:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-14 23:29:24,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-14 23:29:24,036 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-14 23:29:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,039 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2022-04-14 23:29:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2022-04-14 23:29:24,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:24,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-14 23:29:24,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-14 23:29:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:24,042 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-14 23:29:24,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-14 23:29:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:29:24,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:24,043 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:24,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:29:24,044 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1356624439, now seen corresponding path program 1 times [2022-04-14 23:29:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:24,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196320770] [2022-04-14 23:29:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {887#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {881#true} is VALID [2022-04-14 23:29:24,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-04-14 23:29:24,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-04-14 23:29:24,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {887#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:24,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {881#true} is VALID [2022-04-14 23:29:24,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-04-14 23:29:24,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-04-14 23:29:24,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#true} is VALID [2022-04-14 23:29:24,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {881#true} is VALID [2022-04-14 23:29:24,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {881#true} is VALID [2022-04-14 23:29:24,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {881#true} is VALID [2022-04-14 23:29:24,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} [200] L63-->L63-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[] {881#true} is VALID [2022-04-14 23:29:24,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} [201] L63-2-->L67-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] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {886#(= main_~lk2~0 1)} [203] L67-1-->L71-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] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(= main_~lk2~0 1)} [205] L71-1-->L75-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] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(= main_~lk2~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#(= main_~lk2~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {886#(= main_~lk2~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {886#(= main_~lk2~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#(= main_~lk2~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {886#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {886#(= main_~lk2~0 1)} [218] L95-1-->L101-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#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {886#(= main_~lk2~0 1)} [221] L101-1-->L107: 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#(= main_~lk2~0 1)} is VALID [2022-04-14 23:29:24,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(= main_~lk2~0 1)} [225] L107-->L142-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[] {882#false} is VALID [2022-04-14 23:29:24,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {882#false} is VALID [2022-04-14 23:29:24,134 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-14 23:29:24,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196320770] [2022-04-14 23:29:24,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196320770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:24,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:24,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207458870] [2022-04-14 23:29:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:24,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:24,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:24,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:24,152 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,362 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2022-04-14 23:29:24,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:29:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:29:24,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-14 23:29:24,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:24,499 INFO L225 Difference]: With dead ends: 123 [2022-04-14 23:29:24,499 INFO L226 Difference]: Without dead ends: 123 [2022-04-14 23:29:24,499 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-14 23:29:24,500 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:24,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:29:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-14 23:29:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2022-04-14 23:29:24,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:24,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,507 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,507 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,510 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2022-04-14 23:29:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 214 transitions. [2022-04-14 23:29:24,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-14 23:29:24,512 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 123 states. [2022-04-14 23:29:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,516 INFO L93 Difference]: Finished difference Result 123 states and 214 transitions. [2022-04-14 23:29:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 214 transitions. [2022-04-14 23:29:24,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:24,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 153 transitions. [2022-04-14 23:29:24,518 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 153 transitions. Word has length 21 [2022-04-14 23:29:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:24,519 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 153 transitions. [2022-04-14 23:29:24,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 153 transitions. [2022-04-14 23:29:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:29:24,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:24,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:24,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:29:24,520 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1227541720, now seen corresponding path program 1 times [2022-04-14 23:29:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289287070] [2022-04-14 23:29:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1351#true} is VALID [2022-04-14 23:29:24,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-14 23:29:24,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1351#true} {1351#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-14 23:29:24,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {1351#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:24,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1351#true} is VALID [2022-04-14 23:29:24,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-14 23:29:24,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-14 23:29:24,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {1351#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-14 23:29:24,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1351#true} is VALID [2022-04-14 23:29:24,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {1351#true} is VALID [2022-04-14 23:29:24,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1351#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1351#true} is VALID [2022-04-14 23:29:24,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#true} [200] L63-->L63-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[] {1351#true} is VALID [2022-04-14 23:29:24,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#true} [202] L63-2-->L67-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[] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(= main_~p2~0 0)} [203] L67-1-->L71-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] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1356#(= main_~p2~0 0)} [205] L71-1-->L75-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] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#(= main_~p2~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {1356#(= main_~p2~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1356#(= main_~p2~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {1356#(= main_~p2~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {1356#(= main_~p2~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {1356#(= main_~p2~0 0)} [218] L95-1-->L101-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[] {1356#(= main_~p2~0 0)} is VALID [2022-04-14 23:29:24,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {1356#(= main_~p2~0 0)} [221] L101-1-->L107: 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[] {1352#false} is VALID [2022-04-14 23:29:24,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#false} [225] L107-->L142-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[] {1352#false} is VALID [2022-04-14 23:29:24,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-14 23:29:24,592 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-14 23:29:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:24,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289287070] [2022-04-14 23:29:24,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289287070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:24,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:24,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283441967] [2022-04-14 23:29:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:24,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:24,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:24,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:24,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:24,610 INFO L87 Difference]: Start difference. First operand 89 states and 153 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,781 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-04-14 23:29:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:24,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-14 23:29:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-14 23:29:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-14 23:29:24,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-14 23:29:24,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:24,882 INFO L225 Difference]: With dead ends: 125 [2022-04-14 23:29:24,882 INFO L226 Difference]: Without dead ends: 125 [2022-04-14 23:29:24,882 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-14 23:29:24,887 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:24,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-14 23:29:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-14 23:29:24,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:24,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,902 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,902 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,909 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-04-14 23:29:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 212 transitions. [2022-04-14 23:29:24,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-14 23:29:24,911 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-14 23:29:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:24,915 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2022-04-14 23:29:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 212 transitions. [2022-04-14 23:29:24,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:24,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:24,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:24,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-14 23:29:24,930 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-14 23:29:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:24,930 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-14 23:29:24,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-14 23:29:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:29:24,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:24,931 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:24,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:29:24,931 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 894347473, now seen corresponding path program 1 times [2022-04-14 23:29:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:24,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656623076] [2022-04-14 23:29:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:24,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {1867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1861#true} is VALID [2022-04-14 23:29:24,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#true} is VALID [2022-04-14 23:29:24,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1861#true} {1861#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#true} is VALID [2022-04-14 23:29:24,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1861#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:24,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1861#true} is VALID [2022-04-14 23:29:24,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {1861#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#true} is VALID [2022-04-14 23:29:24,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1861#true} {1861#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#true} is VALID [2022-04-14 23:29:24,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1861#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#true} is VALID [2022-04-14 23:29:24,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1861#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1861#true} is VALID [2022-04-14 23:29:24,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {1861#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {1861#true} is VALID [2022-04-14 23:29:24,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1861#true} is VALID [2022-04-14 23:29:24,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#true} [200] L63-->L63-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[] {1861#true} is VALID [2022-04-14 23:29:24,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#true} [201] L63-2-->L67-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] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {1866#(not (= main_~p2~0 0))} [203] L67-1-->L71-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] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#(not (= main_~p2~0 0))} [205] L71-1-->L75-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] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {1866#(not (= main_~p2~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(not (= main_~p2~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {1866#(not (= main_~p2~0 0))} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {1866#(not (= main_~p2~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {1866#(not (= main_~p2~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {1866#(not (= main_~p2~0 0))} [218] L95-1-->L101-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[] {1866#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:29:24,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {1866#(not (= main_~p2~0 0))} [222] L101-1-->L106-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[] {1862#false} is VALID [2022-04-14 23:29:24,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {1862#false} [227] L106-1-->L112: 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[] {1862#false} is VALID [2022-04-14 23:29:24,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {1862#false} [229] L112-->L142-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[] {1862#false} is VALID [2022-04-14 23:29:24,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {1862#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1862#false} is VALID [2022-04-14 23:29:24,999 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-14 23:29:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:24,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656623076] [2022-04-14 23:29:24,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656623076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:24,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:24,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550731898] [2022-04-14 23:29:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:25,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:25,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:25,017 INFO L87 Difference]: Start difference. First operand 123 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,185 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2022-04-14 23:29:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:29:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:29:25,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-14 23:29:25,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:25,285 INFO L225 Difference]: With dead ends: 127 [2022-04-14 23:29:25,285 INFO L226 Difference]: Without dead ends: 127 [2022-04-14 23:29:25,286 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-14 23:29:25,286 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:25,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-14 23:29:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-04-14 23:29:25,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:25,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,292 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,292 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,296 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2022-04-14 23:29:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 212 transitions. [2022-04-14 23:29:25,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:25,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:25,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-14 23:29:25,297 INFO L87 Difference]: Start difference. First operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-14 23:29:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,301 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2022-04-14 23:29:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 212 transitions. [2022-04-14 23:29:25,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:25,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:25,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:25,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 211 transitions. [2022-04-14 23:29:25,306 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 211 transitions. Word has length 22 [2022-04-14 23:29:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:25,306 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 211 transitions. [2022-04-14 23:29:25,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 211 transitions. [2022-04-14 23:29:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:29:25,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:25,307 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:25,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:29:25,307 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:25,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 600944466, now seen corresponding path program 1 times [2022-04-14 23:29:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:25,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710847055] [2022-04-14 23:29:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:25,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {2385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2379#true} is VALID [2022-04-14 23:29:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2379#true} is VALID [2022-04-14 23:29:25,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2379#true} {2379#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2379#true} is VALID [2022-04-14 23:29:25,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:25,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {2385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2379#true} is VALID [2022-04-14 23:29:25,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2379#true} is VALID [2022-04-14 23:29:25,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2379#true} is VALID [2022-04-14 23:29:25,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2379#true} is VALID [2022-04-14 23:29:25,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2379#true} is VALID [2022-04-14 23:29:25,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {2379#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {2379#true} is VALID [2022-04-14 23:29:25,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {2379#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2379#true} is VALID [2022-04-14 23:29:25,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#true} [200] L63-->L63-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[] {2379#true} is VALID [2022-04-14 23:29:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#true} [202] L63-2-->L67-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[] {2379#true} is VALID [2022-04-14 23:29:25,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#true} [203] L67-1-->L71-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] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {2384#(= main_~lk3~0 1)} [205] L71-1-->L75-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] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {2384#(= main_~lk3~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {2384#(= main_~lk3~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {2384#(= main_~lk3~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2384#(= main_~lk3~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2384#(= main_~lk3~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {2384#(= main_~lk3~0 1)} [218] L95-1-->L101-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[] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2384#(= main_~lk3~0 1)} [222] L101-1-->L106-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[] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {2384#(= main_~lk3~0 1)} [227] L106-1-->L112: 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[] {2384#(= main_~lk3~0 1)} is VALID [2022-04-14 23:29:25,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {2384#(= main_~lk3~0 1)} [229] L112-->L142-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[] {2380#false} is VALID [2022-04-14 23:29:25,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2380#false} is VALID [2022-04-14 23:29:25,364 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-14 23:29:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710847055] [2022-04-14 23:29:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710847055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:25,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:25,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032589357] [2022-04-14 23:29:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:25,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:25,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:25,381 INFO L87 Difference]: Start difference. First operand 125 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,542 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-04-14 23:29:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:25,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-04-14 23:29:25,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:25,635 INFO L225 Difference]: With dead ends: 227 [2022-04-14 23:29:25,635 INFO L226 Difference]: Without dead ends: 227 [2022-04-14 23:29:25,635 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-14 23:29:25,636 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:25,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-14 23:29:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 169. [2022-04-14 23:29:25,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:25,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,642 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,642 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,649 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-04-14 23:29:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 388 transitions. [2022-04-14 23:29:25,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:25,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:25,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-14 23:29:25,650 INFO L87 Difference]: Start difference. First operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-14 23:29:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,659 INFO L93 Difference]: Finished difference Result 227 states and 388 transitions. [2022-04-14 23:29:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 388 transitions. [2022-04-14 23:29:25,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:25,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:25,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:25,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 283 transitions. [2022-04-14 23:29:25,677 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 283 transitions. Word has length 22 [2022-04-14 23:29:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:25,677 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 283 transitions. [2022-04-14 23:29:25,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 283 transitions. [2022-04-14 23:29:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:29:25,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:25,678 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:25,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:29:25,678 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:25,679 INFO L85 PathProgramCache]: Analyzing trace with hash 730027185, now seen corresponding path program 1 times [2022-04-14 23:29:25,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:25,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131270331] [2022-04-14 23:29:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:25,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {3247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3241#true} is VALID [2022-04-14 23:29:25,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {3241#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#true} is VALID [2022-04-14 23:29:25,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3241#true} {3241#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#true} is VALID [2022-04-14 23:29:25,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {3241#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:25,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {3247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3241#true} is VALID [2022-04-14 23:29:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {3241#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#true} is VALID [2022-04-14 23:29:25,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3241#true} {3241#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#true} is VALID [2022-04-14 23:29:25,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {3241#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3241#true} is VALID [2022-04-14 23:29:25,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {3241#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3241#true} is VALID [2022-04-14 23:29:25,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {3241#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {3241#true} is VALID [2022-04-14 23:29:25,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {3241#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3241#true} is VALID [2022-04-14 23:29:25,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {3241#true} [200] L63-->L63-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[] {3241#true} is VALID [2022-04-14 23:29:25,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {3241#true} [202] L63-2-->L67-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[] {3241#true} is VALID [2022-04-14 23:29:25,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {3241#true} [204] L67-1-->L71-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[] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {3246#(= main_~p3~0 0)} [205] L71-1-->L75-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] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3246#(= main_~p3~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3246#(= main_~p3~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(= main_~p3~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(= main_~p3~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {3246#(= main_~p3~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {3246#(= main_~p3~0 0)} [218] L95-1-->L101-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[] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {3246#(= main_~p3~0 0)} [222] L101-1-->L106-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[] {3246#(= main_~p3~0 0)} is VALID [2022-04-14 23:29:25,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {3246#(= main_~p3~0 0)} [227] L106-1-->L112: 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[] {3242#false} is VALID [2022-04-14 23:29:25,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {3242#false} [229] L112-->L142-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[] {3242#false} is VALID [2022-04-14 23:29:25,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {3242#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3242#false} is VALID [2022-04-14 23:29:25,756 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-14 23:29:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:25,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131270331] [2022-04-14 23:29:25,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131270331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:25,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:25,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287811511] [2022-04-14 23:29:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:25,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:25,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:25,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:25,773 INFO L87 Difference]: Start difference. First operand 169 states and 283 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:25,923 INFO L93 Difference]: Finished difference Result 235 states and 388 transitions. [2022-04-14 23:29:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-14 23:29:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-04-14 23:29:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-04-14 23:29:25,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-04-14 23:29:26,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,022 INFO L225 Difference]: With dead ends: 235 [2022-04-14 23:29:26,022 INFO L226 Difference]: Without dead ends: 235 [2022-04-14 23:29:26,022 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-14 23:29:26,023 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:26,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-14 23:29:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2022-04-14 23:29:26,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:26,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,029 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,030 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,035 INFO L93 Difference]: Finished difference Result 235 states and 388 transitions. [2022-04-14 23:29:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 388 transitions. [2022-04-14 23:29:26,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-14 23:29:26,037 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 235 states. [2022-04-14 23:29:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,042 INFO L93 Difference]: Finished difference Result 235 states and 388 transitions. [2022-04-14 23:29:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 388 transitions. [2022-04-14 23:29:26,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:26,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 387 transitions. [2022-04-14 23:29:26,048 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 387 transitions. Word has length 22 [2022-04-14 23:29:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:26,048 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 387 transitions. [2022-04-14 23:29:26,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 387 transitions. [2022-04-14 23:29:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:29:26,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:26,049 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:26,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:29:26,049 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1449441508, now seen corresponding path program 1 times [2022-04-14 23:29:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856071685] [2022-04-14 23:29:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {4197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4191#true} is VALID [2022-04-14 23:29:26,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {4191#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4191#true} is VALID [2022-04-14 23:29:26,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4191#true} {4191#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4191#true} is VALID [2022-04-14 23:29:26,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {4191#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:26,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {4197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4191#true} is VALID [2022-04-14 23:29:26,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {4191#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4191#true} is VALID [2022-04-14 23:29:26,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4191#true} {4191#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4191#true} is VALID [2022-04-14 23:29:26,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {4191#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4191#true} is VALID [2022-04-14 23:29:26,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {4191#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4191#true} is VALID [2022-04-14 23:29:26,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {4191#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {4191#true} is VALID [2022-04-14 23:29:26,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {4191#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4191#true} is VALID [2022-04-14 23:29:26,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {4191#true} [200] L63-->L63-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[] {4191#true} is VALID [2022-04-14 23:29:26,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {4191#true} [202] L63-2-->L67-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[] {4191#true} is VALID [2022-04-14 23:29:26,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {4191#true} [203] L67-1-->L71-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] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {4196#(not (= main_~p3~0 0))} [205] L71-1-->L75-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] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {4196#(not (= main_~p3~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {4196#(not (= main_~p3~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {4196#(not (= main_~p3~0 0))} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {4196#(not (= main_~p3~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {4196#(not (= main_~p3~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {4196#(not (= main_~p3~0 0))} [218] L95-1-->L101-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[] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {4196#(not (= main_~p3~0 0))} [222] L101-1-->L106-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[] {4196#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:29:26,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {4196#(not (= main_~p3~0 0))} [228] L106-1-->L111-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[] {4192#false} is VALID [2022-04-14 23:29:26,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {4192#false} [231] L111-1-->L117: 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[] {4192#false} is VALID [2022-04-14 23:29:26,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {4192#false} [233] L117-->L142-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[] {4192#false} is VALID [2022-04-14 23:29:26,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {4192#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4192#false} is VALID [2022-04-14 23:29:26,095 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-14 23:29:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:26,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856071685] [2022-04-14 23:29:26,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856071685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:26,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:26,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547771040] [2022-04-14 23:29:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:26,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:26,112 INFO L87 Difference]: Start difference. First operand 233 states and 387 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,262 INFO L93 Difference]: Finished difference Result 239 states and 388 transitions. [2022-04-14 23:29:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-14 23:29:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-14 23:29:26,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-14 23:29:26,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,362 INFO L225 Difference]: With dead ends: 239 [2022-04-14 23:29:26,362 INFO L226 Difference]: Without dead ends: 239 [2022-04-14 23:29:26,362 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-14 23:29:26,363 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:26,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-14 23:29:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-14 23:29:26,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:26,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,369 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,369 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,374 INFO L93 Difference]: Finished difference Result 239 states and 388 transitions. [2022-04-14 23:29:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-14 23:29:26,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-14 23:29:26,376 INFO L87 Difference]: Start difference. First operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 239 states. [2022-04-14 23:29:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,381 INFO L93 Difference]: Finished difference Result 239 states and 388 transitions. [2022-04-14 23:29:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-14 23:29:26,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:26,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 387 transitions. [2022-04-14 23:29:26,386 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 387 transitions. Word has length 23 [2022-04-14 23:29:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:26,387 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 387 transitions. [2022-04-14 23:29:26,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 387 transitions. [2022-04-14 23:29:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:29:26,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:26,387 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:26,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:29:26,388 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1156038501, now seen corresponding path program 1 times [2022-04-14 23:29:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:26,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579114985] [2022-04-14 23:29:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {5163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5157#true} is VALID [2022-04-14 23:29:26,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {5157#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5157#true} is VALID [2022-04-14 23:29:26,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5157#true} {5157#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5157#true} is VALID [2022-04-14 23:29:26,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {5157#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:26,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {5163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5157#true} is VALID [2022-04-14 23:29:26,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {5157#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5157#true} is VALID [2022-04-14 23:29:26,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5157#true} {5157#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5157#true} is VALID [2022-04-14 23:29:26,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5157#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5157#true} is VALID [2022-04-14 23:29:26,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {5157#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5157#true} is VALID [2022-04-14 23:29:26,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {5157#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {5157#true} is VALID [2022-04-14 23:29:26,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {5157#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {5157#true} is VALID [2022-04-14 23:29:26,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {5157#true} [200] L63-->L63-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[] {5157#true} is VALID [2022-04-14 23:29:26,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {5157#true} [202] L63-2-->L67-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[] {5157#true} is VALID [2022-04-14 23:29:26,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {5157#true} [204] L67-1-->L71-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[] {5157#true} is VALID [2022-04-14 23:29:26,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5157#true} [205] L71-1-->L75-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] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {5162#(= main_~lk4~0 1)} [208] L75-1-->L79-1: Formula: (= 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[] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {5162#(= main_~lk4~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5162#(= main_~lk4~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {5162#(= main_~lk4~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {5162#(= main_~lk4~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {5162#(= main_~lk4~0 1)} [218] L95-1-->L101-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[] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {5162#(= main_~lk4~0 1)} [222] L101-1-->L106-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[] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {5162#(= main_~lk4~0 1)} [228] L106-1-->L111-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[] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {5162#(= main_~lk4~0 1)} [231] L111-1-->L117: 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[] {5162#(= main_~lk4~0 1)} is VALID [2022-04-14 23:29:26,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {5162#(= main_~lk4~0 1)} [233] L117-->L142-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[] {5158#false} is VALID [2022-04-14 23:29:26,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {5158#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5158#false} is VALID [2022-04-14 23:29:26,428 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-14 23:29:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:26,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579114985] [2022-04-14 23:29:26,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579114985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:26,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:26,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542825998] [2022-04-14 23:29:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:26,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:26,444 INFO L87 Difference]: Start difference. First operand 237 states and 387 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,603 INFO L93 Difference]: Finished difference Result 427 states and 704 transitions. [2022-04-14 23:29:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:29:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:29:26,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-14 23:29:26,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,696 INFO L225 Difference]: With dead ends: 427 [2022-04-14 23:29:26,696 INFO L226 Difference]: Without dead ends: 427 [2022-04-14 23:29:26,697 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-14 23:29:26,698 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:26,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-14 23:29:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-14 23:29:26,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:26,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,706 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,708 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,719 INFO L93 Difference]: Finished difference Result 427 states and 704 transitions. [2022-04-14 23:29:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 704 transitions. [2022-04-14 23:29:26,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-14 23:29:26,722 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 427 states. [2022-04-14 23:29:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,736 INFO L93 Difference]: Finished difference Result 427 states and 704 transitions. [2022-04-14 23:29:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 704 transitions. [2022-04-14 23:29:26,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:26,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:26,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:26,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 527 transitions. [2022-04-14 23:29:26,745 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 527 transitions. Word has length 23 [2022-04-14 23:29:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:26,746 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 527 transitions. [2022-04-14 23:29:26,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 527 transitions. [2022-04-14 23:29:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:29:26,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:26,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:26,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:29:26,747 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1285121220, now seen corresponding path program 1 times [2022-04-14 23:29:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984908199] [2022-04-14 23:29:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:26,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6779#true} is VALID [2022-04-14 23:29:26,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {6779#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6779#true} is VALID [2022-04-14 23:29:26,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6779#true} {6779#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6779#true} is VALID [2022-04-14 23:29:26,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {6779#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:26,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {6785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6779#true} is VALID [2022-04-14 23:29:26,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {6779#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6779#true} is VALID [2022-04-14 23:29:26,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6779#true} {6779#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6779#true} is VALID [2022-04-14 23:29:26,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {6779#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6779#true} is VALID [2022-04-14 23:29:26,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {6779#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6779#true} is VALID [2022-04-14 23:29:26,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {6779#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {6779#true} is VALID [2022-04-14 23:29:26,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {6779#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6779#true} is VALID [2022-04-14 23:29:26,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {6779#true} [200] L63-->L63-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[] {6779#true} is VALID [2022-04-14 23:29:26,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {6779#true} [202] L63-2-->L67-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[] {6779#true} is VALID [2022-04-14 23:29:26,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {6779#true} [204] L67-1-->L71-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[] {6779#true} is VALID [2022-04-14 23:29:26,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {6779#true} [206] L71-1-->L75-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[] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(= main_~p4~0 0)} [208] L75-1-->L79-1: Formula: (= 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[] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {6784#(= main_~p4~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {6784#(= main_~p4~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {6784#(= main_~p4~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {6784#(= main_~p4~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {6784#(= main_~p4~0 0)} [218] L95-1-->L101-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[] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {6784#(= main_~p4~0 0)} [222] L101-1-->L106-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[] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {6784#(= main_~p4~0 0)} [228] L106-1-->L111-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[] {6784#(= main_~p4~0 0)} is VALID [2022-04-14 23:29:26,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {6784#(= main_~p4~0 0)} [231] L111-1-->L117: 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[] {6780#false} is VALID [2022-04-14 23:29:26,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {6780#false} [233] L117-->L142-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[] {6780#false} is VALID [2022-04-14 23:29:26,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {6780#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6780#false} is VALID [2022-04-14 23:29:26,809 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-14 23:29:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984908199] [2022-04-14 23:29:26,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984908199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:26,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:26,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859960268] [2022-04-14 23:29:26,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:26,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:26,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:26,827 INFO L87 Difference]: Start difference. First operand 329 states and 527 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:26,979 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-14 23:29:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:29:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-14 23:29:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-14 23:29:26,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-14 23:29:27,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:27,078 INFO L225 Difference]: With dead ends: 451 [2022-04-14 23:29:27,078 INFO L226 Difference]: Without dead ends: 451 [2022-04-14 23:29:27,079 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-14 23:29:27,079 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:27,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-14 23:29:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-14 23:29:27,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:27,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,088 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,089 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,100 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-14 23:29:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 712 transitions. [2022-04-14 23:29:27,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:27,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:27,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-14 23:29:27,103 INFO L87 Difference]: Start difference. First operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-14 23:29:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,115 INFO L93 Difference]: Finished difference Result 451 states and 712 transitions. [2022-04-14 23:29:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 712 transitions. [2022-04-14 23:29:27,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:27,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:27,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:27,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 711 transitions. [2022-04-14 23:29:27,128 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 711 transitions. Word has length 23 [2022-04-14 23:29:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:27,128 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 711 transitions. [2022-04-14 23:29:27,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 711 transitions. [2022-04-14 23:29:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:29:27,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:27,129 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:27,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:29:27,129 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1477487533, now seen corresponding path program 1 times [2022-04-14 23:29:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:27,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58292969] [2022-04-14 23:29:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:27,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {8599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8593#true} is VALID [2022-04-14 23:29:27,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {8593#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8593#true} is VALID [2022-04-14 23:29:27,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8593#true} {8593#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8593#true} is VALID [2022-04-14 23:29:27,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {8593#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:27,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {8599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8593#true} is VALID [2022-04-14 23:29:27,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {8593#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8593#true} is VALID [2022-04-14 23:29:27,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8593#true} {8593#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {8593#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {8593#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {8593#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {8593#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {8593#true} [200] L63-->L63-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[] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {8593#true} [202] L63-2-->L67-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[] {8593#true} is VALID [2022-04-14 23:29:27,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {8593#true} [204] L67-1-->L71-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[] {8593#true} is VALID [2022-04-14 23:29:27,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {8593#true} [205] L71-1-->L75-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] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {8598#(not (= main_~p4~0 0))} [208] L75-1-->L79-1: Formula: (= 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[] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {8598#(not (= main_~p4~0 0))} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {8598#(not (= main_~p4~0 0))} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {8598#(not (= main_~p4~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {8598#(not (= main_~p4~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {8598#(not (= main_~p4~0 0))} [218] L95-1-->L101-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[] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {8598#(not (= main_~p4~0 0))} [222] L101-1-->L106-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[] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {8598#(not (= main_~p4~0 0))} [228] L106-1-->L111-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[] {8598#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:29:27,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {8598#(not (= main_~p4~0 0))} [232] L111-1-->L116-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[] {8594#false} is VALID [2022-04-14 23:29:27,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {8594#false} [235] L116-1-->L122: Formula: (not (= 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[] {8594#false} is VALID [2022-04-14 23:29:27,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {8594#false} [237] L122-->L142-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[] {8594#false} is VALID [2022-04-14 23:29:27,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {8594#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8594#false} is VALID [2022-04-14 23:29:27,168 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-14 23:29:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58292969] [2022-04-14 23:29:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58292969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428481364] [2022-04-14 23:29:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:27,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:27,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:27,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:27,184 INFO L87 Difference]: Start difference. First operand 449 states and 711 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,356 INFO L93 Difference]: Finished difference Result 459 states and 712 transitions. [2022-04-14 23:29:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:27,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-04-14 23:29:27,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:27,460 INFO L225 Difference]: With dead ends: 459 [2022-04-14 23:29:27,460 INFO L226 Difference]: Without dead ends: 459 [2022-04-14 23:29:27,460 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-14 23:29:27,461 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:27,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-14 23:29:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-14 23:29:27,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:27,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,479 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,480 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,491 INFO L93 Difference]: Finished difference Result 459 states and 712 transitions. [2022-04-14 23:29:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 712 transitions. [2022-04-14 23:29:27,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:27,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:27,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-14 23:29:27,494 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-14 23:29:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,506 INFO L93 Difference]: Finished difference Result 459 states and 712 transitions. [2022-04-14 23:29:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 712 transitions. [2022-04-14 23:29:27,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:27,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:27,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:27,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 711 transitions. [2022-04-14 23:29:27,519 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 711 transitions. Word has length 24 [2022-04-14 23:29:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:27,519 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 711 transitions. [2022-04-14 23:29:27,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 711 transitions. [2022-04-14 23:29:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:29:27,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:27,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:27,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:29:27,521 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1184084526, now seen corresponding path program 1 times [2022-04-14 23:29:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:27,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114511989] [2022-04-14 23:29:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:27,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {10445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10439#true} is VALID [2022-04-14 23:29:27,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {10439#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10439#true} is VALID [2022-04-14 23:29:27,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10439#true} {10439#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10439#true} is VALID [2022-04-14 23:29:27,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {10439#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:27,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {10445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {10439#true} is VALID [2022-04-14 23:29:27,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {10439#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10439#true} {10439#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {10439#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {10439#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {10439#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {10439#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {10439#true} [200] L63-->L63-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[] {10439#true} is VALID [2022-04-14 23:29:27,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {10439#true} [202] L63-2-->L67-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[] {10439#true} is VALID [2022-04-14 23:29:27,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {10439#true} [204] L67-1-->L71-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[] {10439#true} is VALID [2022-04-14 23:29:27,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {10439#true} [206] L71-1-->L75-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[] {10439#true} is VALID [2022-04-14 23:29:27,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {10439#true} [208] L75-1-->L79-1: Formula: (= 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[] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {10444#(= main_~p5~0 0)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {10444#(= main_~p5~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {10444#(= main_~p5~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {10444#(= main_~p5~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {10444#(= main_~p5~0 0)} [218] L95-1-->L101-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[] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {10444#(= main_~p5~0 0)} [222] L101-1-->L106-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[] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {10444#(= main_~p5~0 0)} [228] L106-1-->L111-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[] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {10444#(= main_~p5~0 0)} [232] L111-1-->L116-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[] {10444#(= main_~p5~0 0)} is VALID [2022-04-14 23:29:27,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {10444#(= main_~p5~0 0)} [235] L116-1-->L122: Formula: (not (= 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[] {10440#false} is VALID [2022-04-14 23:29:27,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {10440#false} [237] L122-->L142-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[] {10440#false} is VALID [2022-04-14 23:29:27,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {10440#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10440#false} is VALID [2022-04-14 23:29:27,566 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-14 23:29:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:27,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114511989] [2022-04-14 23:29:27,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114511989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:27,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:27,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991488503] [2022-04-14 23:29:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:27,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:27,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:27,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:27,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:27,584 INFO L87 Difference]: Start difference. First operand 457 states and 711 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,772 INFO L93 Difference]: Finished difference Result 875 states and 1320 transitions. [2022-04-14 23:29:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:29:27,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-04-14 23:29:27,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:27,904 INFO L225 Difference]: With dead ends: 875 [2022-04-14 23:29:27,904 INFO L226 Difference]: Without dead ends: 875 [2022-04-14 23:29:27,904 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-14 23:29:27,905 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:27,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 76 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-14 23:29:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-14 23:29:27,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:27,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,920 INFO L74 IsIncluded]: Start isIncluded. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,921 INFO L87 Difference]: Start difference. First operand 875 states. Second operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,958 INFO L93 Difference]: Finished difference Result 875 states and 1320 transitions. [2022-04-14 23:29:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1320 transitions. [2022-04-14 23:29:27,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:27,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:27,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 875 states. [2022-04-14 23:29:27,962 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 875 states. [2022-04-14 23:29:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:27,998 INFO L93 Difference]: Finished difference Result 875 states and 1320 transitions. [2022-04-14 23:29:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1320 transitions. [2022-04-14 23:29:28,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:28,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:28,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:28,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.514384349827388) internal successors, (1316), 869 states have internal predecessors, (1316), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1319 transitions. [2022-04-14 23:29:28,035 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1319 transitions. Word has length 24 [2022-04-14 23:29:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:28,035 INFO L478 AbstractCegarLoop]: Abstraction has 873 states and 1319 transitions. [2022-04-14 23:29:28,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1319 transitions. [2022-04-14 23:29:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:29:28,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:28,037 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:28,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:29:28,037 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1055001807, now seen corresponding path program 1 times [2022-04-14 23:29:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:28,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350442159] [2022-04-14 23:29:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:28,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {13955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13949#true} is VALID [2022-04-14 23:29:28,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {13949#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13949#true} is VALID [2022-04-14 23:29:28,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13949#true} {13949#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13949#true} is VALID [2022-04-14 23:29:28,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {13949#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:28,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {13955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13949#true} is VALID [2022-04-14 23:29:28,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {13949#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13949#true} is VALID [2022-04-14 23:29:28,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13949#true} {13949#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {13949#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {13949#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {13949#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {13949#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {13949#true} [200] L63-->L63-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[] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {13949#true} [202] L63-2-->L67-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[] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {13949#true} [204] L67-1-->L71-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[] {13949#true} is VALID [2022-04-14 23:29:28,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {13949#true} [206] L71-1-->L75-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[] {13949#true} is VALID [2022-04-14 23:29:28,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {13949#true} [207] L75-1-->L79-1: Formula: (and (not (= v_main_~p5~0_3 0)) (= v_main_~lk5~0_3 1)) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3, main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[main_~lk5~0] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {13954#(= main_~lk5~0 1)} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {13954#(= main_~lk5~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {13954#(= main_~lk5~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {13954#(= main_~lk5~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {13954#(= main_~lk5~0 1)} [218] L95-1-->L101-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[] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {13954#(= main_~lk5~0 1)} [222] L101-1-->L106-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[] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {13954#(= main_~lk5~0 1)} [228] L106-1-->L111-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[] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {13954#(= main_~lk5~0 1)} [232] L111-1-->L116-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[] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {13954#(= main_~lk5~0 1)} [235] L116-1-->L122: Formula: (not (= 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[] {13954#(= main_~lk5~0 1)} is VALID [2022-04-14 23:29:28,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {13954#(= main_~lk5~0 1)} [237] L122-->L142-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[] {13950#false} is VALID [2022-04-14 23:29:28,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {13950#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13950#false} is VALID [2022-04-14 23:29:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:29:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:28,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350442159] [2022-04-14 23:29:28,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350442159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:28,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:28,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973371561] [2022-04-14 23:29:28,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:28,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:28,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:28,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:28,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:28,097 INFO L87 Difference]: Start difference. First operand 873 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,294 INFO L93 Difference]: Finished difference Result 1035 states and 1592 transitions. [2022-04-14 23:29:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:28,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-14 23:29:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-14 23:29:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-14 23:29:28,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-14 23:29:28,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:28,424 INFO L225 Difference]: With dead ends: 1035 [2022-04-14 23:29:28,424 INFO L226 Difference]: Without dead ends: 1035 [2022-04-14 23:29:28,424 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-14 23:29:28,425 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:28,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 104 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-04-14 23:29:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 873. [2022-04-14 23:29:28,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:28,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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-14 23:29:28,442 INFO L74 IsIncluded]: Start isIncluded. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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-14 23:29:28,443 INFO L87 Difference]: Start difference. First operand 1035 states. Second operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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-14 23:29:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,520 INFO L93 Difference]: Finished difference Result 1035 states and 1592 transitions. [2022-04-14 23:29:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1592 transitions. [2022-04-14 23:29:28,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:28,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:28,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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 1035 states. [2022-04-14 23:29:28,526 INFO L87 Difference]: Start difference. First operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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 1035 states. [2022-04-14 23:29:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,575 INFO L93 Difference]: Finished difference Result 1035 states and 1592 transitions. [2022-04-14 23:29:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1592 transitions. [2022-04-14 23:29:28,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:28,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:28,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:28,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 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-14 23:29:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1303 transitions. [2022-04-14 23:29:28,617 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1303 transitions. Word has length 24 [2022-04-14 23:29:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:28,617 INFO L478 AbstractCegarLoop]: Abstraction has 873 states and 1303 transitions. [2022-04-14 23:29:28,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1303 transitions. [2022-04-14 23:29:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:29:28,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:28,618 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:28,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:29:28,619 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1948052864, now seen corresponding path program 1 times [2022-04-14 23:29:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:28,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9411782] [2022-04-14 23:29:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:28,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {17945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17939#true} is VALID [2022-04-14 23:29:28,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {17939#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17939#true} is VALID [2022-04-14 23:29:28,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17939#true} {17939#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17939#true} is VALID [2022-04-14 23:29:28,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {17939#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:28,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {17945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17939#true} is VALID [2022-04-14 23:29:28,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {17939#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17939#true} {17939#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {17939#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {17939#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {17939#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {17939#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {17939#true} [200] L63-->L63-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[] {17939#true} is VALID [2022-04-14 23:29:28,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {17939#true} [202] L63-2-->L67-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[] {17939#true} is VALID [2022-04-14 23:29:28,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {17939#true} [204] L67-1-->L71-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[] {17939#true} is VALID [2022-04-14 23:29:28,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {17939#true} [206] L71-1-->L75-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[] {17939#true} is VALID [2022-04-14 23:29:28,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {17939#true} [208] L75-1-->L79-1: Formula: (= 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[] {17939#true} is VALID [2022-04-14 23:29:28,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {17939#true} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {17944#(= main_~lk6~0 1)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {17944#(= main_~lk6~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {17944#(= main_~lk6~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {17944#(= main_~lk6~0 1)} [218] L95-1-->L101-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[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {17944#(= main_~lk6~0 1)} [222] L101-1-->L106-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[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {17944#(= main_~lk6~0 1)} [228] L106-1-->L111-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[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {17944#(= main_~lk6~0 1)} [232] L111-1-->L116-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[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {17944#(= main_~lk6~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {17944#(= main_~lk6~0 1)} [239] L121-1-->L127: Formula: (not (= v_main_~p6~0_1 0)) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {17944#(= main_~lk6~0 1)} is VALID [2022-04-14 23:29:28,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {17944#(= main_~lk6~0 1)} [241] L127-->L142-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {17940#false} is VALID [2022-04-14 23:29:28,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {17940#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17940#false} is VALID [2022-04-14 23:29:28,669 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-14 23:29:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9411782] [2022-04-14 23:29:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9411782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:28,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:28,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946433884] [2022-04-14 23:29:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:29:28,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:28,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:28,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:28,689 INFO L87 Difference]: Start difference. First operand 873 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,937 INFO L93 Difference]: Finished difference Result 1531 states and 2296 transitions. [2022-04-14 23:29:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:29:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-14 23:29:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-14 23:29:28,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-04-14 23:29:29,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:29,126 INFO L225 Difference]: With dead ends: 1531 [2022-04-14 23:29:29,126 INFO L226 Difference]: Without dead ends: 1531 [2022-04-14 23:29:29,128 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-14 23:29:29,129 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:29,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-14 23:29:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1273. [2022-04-14 23:29:29,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:29,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,152 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,153 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:29,246 INFO L93 Difference]: Finished difference Result 1531 states and 2296 transitions. [2022-04-14 23:29:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2296 transitions. [2022-04-14 23:29:29,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:29,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:29,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1531 states. [2022-04-14 23:29:29,255 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1531 states. [2022-04-14 23:29:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:29,348 INFO L93 Difference]: Finished difference Result 1531 states and 2296 transitions. [2022-04-14 23:29:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2296 transitions. [2022-04-14 23:29:29,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:29,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:29,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:29,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.4531126871552404) internal successors, (1844), 1269 states have internal predecessors, (1844), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1847 transitions. [2022-04-14 23:29:29,421 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1847 transitions. Word has length 25 [2022-04-14 23:29:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:29,421 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 1847 transitions. [2022-04-14 23:29:29,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1847 transitions. [2022-04-14 23:29:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:29:29,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:29,423 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:29,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:29:29,423 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1818970145, now seen corresponding path program 1 times [2022-04-14 23:29:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:29,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163238543] [2022-04-14 23:29:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:29,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {23823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23817#true} is VALID [2022-04-14 23:29:29,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {23817#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23817#true} is VALID [2022-04-14 23:29:29,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23817#true} {23817#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23817#true} is VALID [2022-04-14 23:29:29,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {23817#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:29,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {23823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23817#true} is VALID [2022-04-14 23:29:29,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {23817#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23817#true} {23817#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {23817#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {23817#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {23817#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {23817#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {23817#true} is VALID [2022-04-14 23:29:29,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {23817#true} [200] L63-->L63-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[] {23817#true} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {23817#true} [202] L63-2-->L67-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[] {23817#true} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {23817#true} [204] L67-1-->L71-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[] {23817#true} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {23817#true} [206] L71-1-->L75-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[] {23817#true} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {23817#true} [208] L75-1-->L79-1: Formula: (= 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[] {23817#true} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {23817#true} [210] L79-1-->L83-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[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {23822#(= main_~p6~0 0)} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {23822#(= main_~p6~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {23822#(= main_~p6~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {23822#(= main_~p6~0 0)} [218] L95-1-->L101-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[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {23822#(= main_~p6~0 0)} [222] L101-1-->L106-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[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {23822#(= main_~p6~0 0)} [228] L106-1-->L111-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[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {23822#(= main_~p6~0 0)} [232] L111-1-->L116-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[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {23822#(= main_~p6~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {23822#(= main_~p6~0 0)} is VALID [2022-04-14 23:29:29,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {23822#(= main_~p6~0 0)} [239] L121-1-->L127: Formula: (not (= v_main_~p6~0_1 0)) InVars {main_~p6~0=v_main_~p6~0_1} OutVars{main_~p6~0=v_main_~p6~0_1} AuxVars[] AssignedVars[] {23818#false} is VALID [2022-04-14 23:29:29,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {23818#false} [241] L127-->L142-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {23818#false} is VALID [2022-04-14 23:29:29,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {23818#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23818#false} is VALID [2022-04-14 23:29:29,472 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-14 23:29:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:29,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163238543] [2022-04-14 23:29:29,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163238543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:29,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:29,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722988771] [2022-04-14 23:29:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:29:29,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:29,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:29,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:29,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:29,492 INFO L87 Difference]: Start difference. First operand 1273 states and 1847 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:29,754 INFO L93 Difference]: Finished difference Result 1691 states and 2408 transitions. [2022-04-14 23:29:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:29:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-14 23:29:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-14 23:29:29,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-14 23:29:29,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:29,960 INFO L225 Difference]: With dead ends: 1691 [2022-04-14 23:29:29,960 INFO L226 Difference]: Without dead ends: 1691 [2022-04-14 23:29:29,960 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-14 23:29:29,961 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:29,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-04-14 23:29:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2022-04-14 23:29:29,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:29,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,001 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,003 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:30,124 INFO L93 Difference]: Finished difference Result 1691 states and 2408 transitions. [2022-04-14 23:29:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2408 transitions. [2022-04-14 23:29:30,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:30,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:30,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1691 states. [2022-04-14 23:29:30,131 INFO L87 Difference]: Start difference. First operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1691 states. [2022-04-14 23:29:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:30,257 INFO L93 Difference]: Finished difference Result 1691 states and 2408 transitions. [2022-04-14 23:29:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2408 transitions. [2022-04-14 23:29:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:30,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:30,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:30,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1685 states have (on average 1.426706231454006) internal successors, (2404), 1685 states have internal predecessors, (2404), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2407 transitions. [2022-04-14 23:29:30,386 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2407 transitions. Word has length 25 [2022-04-14 23:29:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:30,386 INFO L478 AbstractCegarLoop]: Abstraction has 1689 states and 2407 transitions. [2022-04-14 23:29:30,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2407 transitions. [2022-04-14 23:29:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:29:30,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:30,388 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-14 23:29:30,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:29:30,388 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash -260064022, now seen corresponding path program 1 times [2022-04-14 23:29:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:30,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553004920] [2022-04-14 23:29:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:30,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {30597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30591#true} is VALID [2022-04-14 23:29:30,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {30591#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30591#true} is VALID [2022-04-14 23:29:30,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30591#true} {30591#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30591#true} is VALID [2022-04-14 23:29:30,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {30591#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:30,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {30597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {30591#true} is VALID [2022-04-14 23:29:30,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {30591#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30591#true} is VALID [2022-04-14 23:29:30,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30591#true} {30591#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {30591#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {30591#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {30591#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {30591#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {30591#true} [200] L63-->L63-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[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {30591#true} [202] L63-2-->L67-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[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {30591#true} [204] L67-1-->L71-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[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {30591#true} [206] L71-1-->L75-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[] {30591#true} is VALID [2022-04-14 23:29:30,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {30591#true} [208] L75-1-->L79-1: Formula: (= 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[] {30591#true} is VALID [2022-04-14 23:29:30,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {30591#true} [209] L79-1-->L83-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {30596#(not (= main_~p6~0 0))} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {30596#(not (= main_~p6~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {30596#(not (= main_~p6~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {30596#(not (= main_~p6~0 0))} [218] L95-1-->L101-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[] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {30596#(not (= main_~p6~0 0))} [222] L101-1-->L106-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[] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {30596#(not (= main_~p6~0 0))} [228] L106-1-->L111-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[] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {30596#(not (= main_~p6~0 0))} [232] L111-1-->L116-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[] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {30596#(not (= main_~p6~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {30596#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:29:30,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {30596#(not (= main_~p6~0 0))} [240] L121-1-->L126-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[] {30592#false} is VALID [2022-04-14 23:29:30,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {30592#false} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {30592#false} is VALID [2022-04-14 23:29:30,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {30592#false} [245] L132-->L142-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {30592#false} is VALID [2022-04-14 23:29:30,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {30592#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30592#false} is VALID [2022-04-14 23:29:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:29:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:30,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553004920] [2022-04-14 23:29:30,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553004920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:30,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:30,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421414254] [2022-04-14 23:29:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:30,425 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-14 23:29:30,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:30,426 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-14 23:29:30,440 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-14 23:29:30,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:30,441 INFO L87 Difference]: Start difference. First operand 1689 states and 2407 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-14 23:29:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:30,699 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-14 23:29:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:30,699 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-14 23:29:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:30,699 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-14 23:29:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:29:30,702 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-14 23:29:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:29:30,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-14 23:29:30,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:30,925 INFO L225 Difference]: With dead ends: 1739 [2022-04-14 23:29:30,926 INFO L226 Difference]: Without dead ends: 1739 [2022-04-14 23:29:30,926 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-14 23:29:30,926 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:30,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-14 23:29:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-14 23:29:30,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:30,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,955 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:30,957 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:31,078 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-14 23:29:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-14 23:29:31,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:31,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:31,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-14 23:29:31,085 INFO L87 Difference]: Start difference. First operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1739 states. [2022-04-14 23:29:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:31,206 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2022-04-14 23:29:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2440 transitions. [2022-04-14 23:29:31,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:31,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:31,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:31,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-14 23:29:31,316 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-14 23:29:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:31,316 INFO L478 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-14 23:29:31,316 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-14 23:29:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-14 23:29:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:29:31,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:31,318 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-14 23:29:31,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:29:31,319 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -553467029, now seen corresponding path program 1 times [2022-04-14 23:29:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:31,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198577022] [2022-04-14 23:29:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:31,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {37563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37557#true} is VALID [2022-04-14 23:29:31,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {37557#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37557#true} is VALID [2022-04-14 23:29:31,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37557#true} {37557#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37557#true} is VALID [2022-04-14 23:29:31,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {37557#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:31,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {37563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37557#true} is VALID [2022-04-14 23:29:31,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {37557#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37557#true} is VALID [2022-04-14 23:29:31,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37557#true} {37557#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37557#true} is VALID [2022-04-14 23:29:31,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {37557#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37557#true} is VALID [2022-04-14 23:29:31,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {37557#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {37557#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {37557#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {37557#true} [200] L63-->L63-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[] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {37557#true} [202] L63-2-->L67-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[] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {37557#true} [204] L67-1-->L71-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[] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {37557#true} [206] L71-1-->L75-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[] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {37557#true} [208] L75-1-->L79-1: Formula: (= 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[] {37557#true} is VALID [2022-04-14 23:29:31,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {37557#true} [210] L79-1-->L83-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[] {37557#true} is VALID [2022-04-14 23:29:31,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {37557#true} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {37562#(= main_~lk7~0 1)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {37562#(= main_~lk7~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {37562#(= main_~lk7~0 1)} [218] L95-1-->L101-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[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {37562#(= main_~lk7~0 1)} [222] L101-1-->L106-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[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {37562#(= main_~lk7~0 1)} [228] L106-1-->L111-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[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {37562#(= main_~lk7~0 1)} [232] L111-1-->L116-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[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {37562#(= main_~lk7~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {37562#(= main_~lk7~0 1)} [240] L121-1-->L126-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[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {37562#(= main_~lk7~0 1)} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {37562#(= main_~lk7~0 1)} is VALID [2022-04-14 23:29:31,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {37562#(= main_~lk7~0 1)} [245] L132-->L142-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {37558#false} is VALID [2022-04-14 23:29:31,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {37558#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37558#false} is VALID [2022-04-14 23:29:31,357 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-14 23:29:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:31,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198577022] [2022-04-14 23:29:31,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198577022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:31,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:31,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928813344] [2022-04-14 23:29:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:31,358 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-14 23:29:31,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:31,359 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-14 23:29:31,375 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-14 23:29:31,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:31,376 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 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-14 23:29:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:31,758 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-14 23:29:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:31,758 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-14 23:29:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:31,758 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-14 23:29:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-14 23:29:31,760 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-14 23:29:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-14 23:29:31,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-14 23:29:31,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:32,124 INFO L225 Difference]: With dead ends: 2955 [2022-04-14 23:29:32,124 INFO L226 Difference]: Without dead ends: 2955 [2022-04-14 23:29:32,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:29:32,125 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:32,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-14 23:29:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-14 23:29:32,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:32,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:32,164 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:32,166 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:32,375 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-14 23:29:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-14 23:29:32,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:32,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:32,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-14 23:29:32,388 INFO L87 Difference]: Start difference. First operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-14 23:29:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:32,697 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2022-04-14 23:29:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4136 transitions. [2022-04-14 23:29:32,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:32,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:32,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-14 23:29:32,963 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-14 23:29:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:32,963 INFO L478 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-14 23:29:32,963 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-14 23:29:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-14 23:29:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:29:32,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:32,966 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-14 23:29:32,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 23:29:32,966 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -424384310, now seen corresponding path program 1 times [2022-04-14 23:29:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:32,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149292700] [2022-04-14 23:29:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:33,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {49009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {49003#true} is VALID [2022-04-14 23:29:33,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {49003#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49003#true} is VALID [2022-04-14 23:29:33,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49003#true} {49003#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49003#true} is VALID [2022-04-14 23:29:33,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {49003#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:33,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {49009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {49003#true} is VALID [2022-04-14 23:29:33,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {49003#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49003#true} is VALID [2022-04-14 23:29:33,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49003#true} {49003#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {49003#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {49003#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {49003#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {49003#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {49003#true} [200] L63-->L63-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[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {49003#true} [202] L63-2-->L67-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[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {49003#true} [204] L67-1-->L71-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[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {49003#true} [206] L71-1-->L75-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[] {49003#true} is VALID [2022-04-14 23:29:33,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {49003#true} [208] L75-1-->L79-1: Formula: (= 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[] {49003#true} is VALID [2022-04-14 23:29:33,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {49003#true} [210] L79-1-->L83-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[] {49003#true} is VALID [2022-04-14 23:29:33,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {49003#true} [212] L83-1-->L87-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {49008#(= main_~p7~0 0)} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {49008#(= main_~p7~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {49008#(= main_~p7~0 0)} [218] L95-1-->L101-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {49008#(= main_~p7~0 0)} [222] L101-1-->L106-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {49008#(= main_~p7~0 0)} [228] L106-1-->L111-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {49008#(= main_~p7~0 0)} [232] L111-1-->L116-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {49008#(= main_~p7~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {49008#(= main_~p7~0 0)} [240] L121-1-->L126-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[] {49008#(= main_~p7~0 0)} is VALID [2022-04-14 23:29:33,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {49008#(= main_~p7~0 0)} [243] L126-1-->L132: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {49004#false} is VALID [2022-04-14 23:29:33,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {49004#false} [245] L132-->L142-1: Formula: (not (= v_main_~lk7~0_2 1)) InVars {main_~lk7~0=v_main_~lk7~0_2} OutVars{main_~lk7~0=v_main_~lk7~0_2} AuxVars[] AssignedVars[] {49004#false} is VALID [2022-04-14 23:29:33,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {49004#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49004#false} is VALID [2022-04-14 23:29:33,013 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-14 23:29:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:33,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149292700] [2022-04-14 23:29:33,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149292700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:33,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:33,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:33,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117583487] [2022-04-14 23:29:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:33,015 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-14 23:29:33,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:33,015 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-14 23:29:33,032 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-14 23:29:33,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:33,033 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 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-14 23:29:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:33,499 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-14 23:29:33,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:33,500 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-14 23:29:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:33,500 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-14 23:29:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-04-14 23:29:33,501 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-14 23:29:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-04-14 23:29:33,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 105 transitions. [2022-04-14 23:29:33,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:33,909 INFO L225 Difference]: With dead ends: 3339 [2022-04-14 23:29:33,909 INFO L226 Difference]: Without dead ends: 3339 [2022-04-14 23:29:33,910 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-14 23:29:33,910 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:33,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-14 23:29:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-14 23:29:33,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:33,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:33,963 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:33,966 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:34,352 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-14 23:29:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-14 23:29:34,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:34,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:34,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-14 23:29:34,364 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3339 states. [2022-04-14 23:29:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:34,781 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2022-04-14 23:29:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4424 transitions. [2022-04-14 23:29:34,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:34,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:34,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:34,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-14 23:29:35,109 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-14 23:29:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:35,109 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-14 23:29:35,109 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-14 23:29:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-14 23:29:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:29:35,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:35,112 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-14 23:29:35,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 23:29:35,112 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 22424027, now seen corresponding path program 1 times [2022-04-14 23:29:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:35,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044598048] [2022-04-14 23:29:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:35,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:35,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {62375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {62369#true} is VALID [2022-04-14 23:29:35,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {62369#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62369#true} is VALID [2022-04-14 23:29:35,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62369#true} {62369#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62369#true} is VALID [2022-04-14 23:29:35,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {62369#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:35,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {62375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {62369#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62369#true} {62369#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {62369#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {62369#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {62369#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {62369#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {62369#true} is VALID [2022-04-14 23:29:35,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {62369#true} [200] L63-->L63-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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {62369#true} [202] L63-2-->L67-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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {62369#true} [204] L67-1-->L71-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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {62369#true} [206] L71-1-->L75-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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {62369#true} [208] L75-1-->L79-1: Formula: (= 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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {62369#true} [210] L79-1-->L83-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[] {62369#true} is VALID [2022-04-14 23:29:35,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {62369#true} [211] L83-1-->L87-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {62374#(not (= main_~p7~0 0))} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {62374#(not (= main_~p7~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {62374#(not (= main_~p7~0 0))} [218] L95-1-->L101-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[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {62374#(not (= main_~p7~0 0))} [222] L101-1-->L106-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[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {62374#(not (= main_~p7~0 0))} [228] L106-1-->L111-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[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {62374#(not (= main_~p7~0 0))} [232] L111-1-->L116-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[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {62374#(not (= main_~p7~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {62374#(not (= main_~p7~0 0))} [240] L121-1-->L126-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[] {62374#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:29:35,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {62374#(not (= main_~p7~0 0))} [244] L126-1-->L131-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[] {62370#false} is VALID [2022-04-14 23:29:35,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {62370#false} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {62370#false} is VALID [2022-04-14 23:29:35,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {62370#false} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {62370#false} is VALID [2022-04-14 23:29:35,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {62370#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62370#false} is VALID [2022-04-14 23:29:35,147 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-14 23:29:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044598048] [2022-04-14 23:29:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044598048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:35,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:35,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953401631] [2022-04-14 23:29:35,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:35,148 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-14 23:29:35,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:35,148 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-14 23:29:35,163 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-14 23:29:35,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:35,164 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 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-14 23:29:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:35,623 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-14 23:29:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:35,624 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-14 23:29:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:35,624 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-14 23:29:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-14 23:29:35,625 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-14 23:29:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-04-14 23:29:35,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 104 transitions. [2022-04-14 23:29:35,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:36,029 INFO L225 Difference]: With dead ends: 3403 [2022-04-14 23:29:36,029 INFO L226 Difference]: Without dead ends: 3403 [2022-04-14 23:29:36,030 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-14 23:29:36,030 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:36,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-14 23:29:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-14 23:29:36,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:36,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:36,101 INFO L74 IsIncluded]: Start isIncluded. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:36,103 INFO L87 Difference]: Start difference. First operand 3403 states. Second operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:36,417 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-14 23:29:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-14 23:29:36,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:36,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:36,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3403 states. [2022-04-14 23:29:36,426 INFO L87 Difference]: Start difference. First operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3403 states. [2022-04-14 23:29:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:36,781 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2022-04-14 23:29:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4424 transitions. [2022-04-14 23:29:36,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:36,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:36,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:36,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-14 23:29:37,142 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-14 23:29:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:37,142 INFO L478 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-14 23:29:37,142 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-14 23:29:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-14 23:29:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:29:37,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:37,145 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-14 23:29:37,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 23:29:37,145 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -270978980, now seen corresponding path program 1 times [2022-04-14 23:29:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:37,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378835520] [2022-04-14 23:29:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:37,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {75997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {75991#true} is VALID [2022-04-14 23:29:37,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {75991#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75991#true} is VALID [2022-04-14 23:29:37,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75991#true} {75991#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75991#true} is VALID [2022-04-14 23:29:37,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {75991#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:37,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {75997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {75991#true} is VALID [2022-04-14 23:29:37,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {75991#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75991#true} is VALID [2022-04-14 23:29:37,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75991#true} {75991#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75991#true} is VALID [2022-04-14 23:29:37,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {75991#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {75991#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {75991#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {75991#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {75991#true} [200] L63-->L63-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[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {75991#true} [202] L63-2-->L67-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[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {75991#true} [204] L67-1-->L71-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[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {75991#true} [206] L71-1-->L75-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[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {75991#true} [208] L75-1-->L79-1: Formula: (= 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[] {75991#true} is VALID [2022-04-14 23:29:37,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {75991#true} [210] L79-1-->L83-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[] {75991#true} is VALID [2022-04-14 23:29:37,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {75991#true} [212] L83-1-->L87-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[] {75991#true} is VALID [2022-04-14 23:29:37,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {75991#true} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {75996#(= main_~lk8~0 1)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {75996#(= main_~lk8~0 1)} [218] L95-1-->L101-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {75996#(= main_~lk8~0 1)} [222] L101-1-->L106-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {75996#(= main_~lk8~0 1)} [228] L106-1-->L111-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {75996#(= main_~lk8~0 1)} [232] L111-1-->L116-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {75996#(= main_~lk8~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {75996#(= main_~lk8~0 1)} [240] L121-1-->L126-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {75996#(= main_~lk8~0 1)} [244] L126-1-->L131-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[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {75996#(= main_~lk8~0 1)} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {75996#(= main_~lk8~0 1)} is VALID [2022-04-14 23:29:37,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {75996#(= main_~lk8~0 1)} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {75992#false} is VALID [2022-04-14 23:29:37,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {75992#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75992#false} is VALID [2022-04-14 23:29:37,186 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-14 23:29:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378835520] [2022-04-14 23:29:37,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378835520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:37,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:37,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505137709] [2022-04-14 23:29:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:37,187 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-14 23:29:37,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:37,188 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-14 23:29:37,205 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-14 23:29:37,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:37,206 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 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-14 23:29:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:38,187 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-14 23:29:38,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:38,187 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-14 23:29:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:38,187 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-14 23:29:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-14 23:29:38,188 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-14 23:29:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-14 23:29:38,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-04-14 23:29:38,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:39,260 INFO L225 Difference]: With dead ends: 5643 [2022-04-14 23:29:39,261 INFO L226 Difference]: Without dead ends: 5643 [2022-04-14 23:29:39,261 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-14 23:29:39,264 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:39,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-14 23:29:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-14 23:29:39,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:39,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:39,340 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:39,343 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:40,219 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-14 23:29:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-14 23:29:40,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:40,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:40,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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-14 23:29:40,229 INFO L87 Difference]: Start difference. First operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states 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-14 23:29:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:41,092 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2022-04-14 23:29:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 7240 transitions. [2022-04-14 23:29:41,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:41,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:41,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:41,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-14 23:29:41,785 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-14 23:29:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:41,785 INFO L478 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-14 23:29:41,785 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-14 23:29:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-14 23:29:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:29:41,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:41,790 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-14 23:29:41,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 23:29:41,790 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash -141896261, now seen corresponding path program 1 times [2022-04-14 23:29:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867269945] [2022-04-14 23:29:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {98067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98061#true} is VALID [2022-04-14 23:29:41,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {98061#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98061#true} is VALID [2022-04-14 23:29:41,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98061#true} {98061#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98061#true} is VALID [2022-04-14 23:29:41,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {98061#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:41,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {98067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98061#true} is VALID [2022-04-14 23:29:41,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {98061#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98061#true} is VALID [2022-04-14 23:29:41,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98061#true} {98061#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98061#true} is VALID [2022-04-14 23:29:41,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {98061#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98061#true} is VALID [2022-04-14 23:29:41,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {98061#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {98061#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {98061#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {98061#true} [200] L63-->L63-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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {98061#true} [202] L63-2-->L67-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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {98061#true} [204] L67-1-->L71-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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {98061#true} [206] L71-1-->L75-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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {98061#true} [208] L75-1-->L79-1: Formula: (= 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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {98061#true} [210] L79-1-->L83-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[] {98061#true} is VALID [2022-04-14 23:29:41,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {98061#true} [212] L83-1-->L87-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[] {98061#true} is VALID [2022-04-14 23:29:41,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {98061#true} [214] L87-1-->L91-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {98066#(= main_~p8~0 0)} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {98066#(= main_~p8~0 0)} [218] L95-1-->L101-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {98066#(= main_~p8~0 0)} [222] L101-1-->L106-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {98066#(= main_~p8~0 0)} [228] L106-1-->L111-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {98066#(= main_~p8~0 0)} [232] L111-1-->L116-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {98066#(= main_~p8~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {98066#(= main_~p8~0 0)} [240] L121-1-->L126-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {98066#(= main_~p8~0 0)} [244] L126-1-->L131-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[] {98066#(= main_~p8~0 0)} is VALID [2022-04-14 23:29:41,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {98066#(= main_~p8~0 0)} [247] L131-1-->L137: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {98062#false} is VALID [2022-04-14 23:29:41,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {98062#false} [249] L137-->L142-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {98062#false} is VALID [2022-04-14 23:29:41,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {98062#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98062#false} is VALID [2022-04-14 23:29:41,834 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-14 23:29:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867269945] [2022-04-14 23:29:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867269945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:41,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248461234] [2022-04-14 23:29:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:41,835 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-14 23:29:41,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:41,835 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-14 23:29:41,852 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-14 23:29:41,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:41,852 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 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-14 23:29:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:43,184 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-14 23:29:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:43,185 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-14 23:29:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:43,185 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-14 23:29:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-14 23:29:43,186 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-14 23:29:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-14 23:29:43,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-14 23:29:43,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:44,637 INFO L225 Difference]: With dead ends: 6539 [2022-04-14 23:29:44,638 INFO L226 Difference]: Without dead ends: 6539 [2022-04-14 23:29:44,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:29:44,639 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:44,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-14 23:29:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-14 23:29:44,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:44,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:44,735 INFO L74 IsIncluded]: Start isIncluded. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:44,739 INFO L87 Difference]: Start difference. First operand 6539 states. Second operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:45,925 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-14 23:29:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-14 23:29:45,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:45,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:45,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6539 states. [2022-04-14 23:29:45,938 INFO L87 Difference]: Start difference. First operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6539 states. [2022-04-14 23:29:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:47,086 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2022-04-14 23:29:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7944 transitions. [2022-04-14 23:29:47,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:47,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:47,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:47,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-14 23:29:48,323 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-14 23:29:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:48,324 INFO L478 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-14 23:29:48,324 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-14 23:29:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-14 23:29:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:29:48,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:48,327 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-14 23:29:48,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 23:29:48,327 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 189619078, now seen corresponding path program 1 times [2022-04-14 23:29:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131764892] [2022-04-14 23:29:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:48,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {124233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124227#true} is VALID [2022-04-14 23:29:48,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {124227#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124227#true} is VALID [2022-04-14 23:29:48,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124227#true} {124227#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124227#true} is VALID [2022-04-14 23:29:48,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {124227#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:48,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {124233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124227#true} is VALID [2022-04-14 23:29:48,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {124227#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124227#true} is VALID [2022-04-14 23:29:48,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124227#true} {124227#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124227#true} is VALID [2022-04-14 23:29:48,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {124227#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124227#true} is VALID [2022-04-14 23:29:48,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {124227#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {124227#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {124227#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {124227#true} [200] L63-->L63-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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {124227#true} [202] L63-2-->L67-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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {124227#true} [204] L67-1-->L71-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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {124227#true} [206] L71-1-->L75-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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {124227#true} [208] L75-1-->L79-1: Formula: (= 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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {124227#true} [210] L79-1-->L83-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[] {124227#true} is VALID [2022-04-14 23:29:48,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {124227#true} [212] L83-1-->L87-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[] {124227#true} is VALID [2022-04-14 23:29:48,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {124227#true} [213] L87-1-->L91-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {124232#(not (= main_~p8~0 0))} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {124232#(not (= main_~p8~0 0))} [218] L95-1-->L101-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {124232#(not (= main_~p8~0 0))} [222] L101-1-->L106-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {124232#(not (= main_~p8~0 0))} [228] L106-1-->L111-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {124232#(not (= main_~p8~0 0))} [232] L111-1-->L116-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {124232#(not (= main_~p8~0 0))} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {124232#(not (= main_~p8~0 0))} [240] L121-1-->L126-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {124232#(not (= main_~p8~0 0))} [244] L126-1-->L131-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[] {124232#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:29:48,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {124232#(not (= main_~p8~0 0))} [248] L131-1-->L136-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[] {124228#false} is VALID [2022-04-14 23:29:48,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {124228#false} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {124228#false} is VALID [2022-04-14 23:29:48,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {124228#false} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {124228#false} is VALID [2022-04-14 23:29:48,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {124228#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124228#false} is VALID [2022-04-14 23:29:48,379 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-14 23:29:48,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:48,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131764892] [2022-04-14 23:29:48,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131764892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:48,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:48,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469920777] [2022-04-14 23:29:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:48,380 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-14 23:29:48,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:48,381 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-14 23:29:48,398 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-14 23:29:48,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:48,398 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 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-14 23:29:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:49,807 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-14 23:29:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:49,807 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-14 23:29:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:49,807 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-14 23:29:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-14 23:29:49,808 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-14 23:29:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-14 23:29:49,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-14 23:29:49,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:51,189 INFO L225 Difference]: With dead ends: 6667 [2022-04-14 23:29:51,189 INFO L226 Difference]: Without dead ends: 6667 [2022-04-14 23:29:51,189 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-14 23:29:51,189 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:51,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:29:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-14 23:29:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-14 23:29:51,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:51,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:51,262 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:51,267 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:52,556 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-14 23:29:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-14 23:29:52,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:52,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:52,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6667 states. [2022-04-14 23:29:52,570 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 6667 states. [2022-04-14 23:29:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:53,875 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2022-04-14 23:29:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 7944 transitions. [2022-04-14 23:29:53,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:53,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:53,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:53,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-14 23:29:55,169 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-14 23:29:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:55,169 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-14 23:29:55,169 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-14 23:29:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-14 23:29:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:29:55,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:55,172 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-14 23:29:55,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 23:29:55,172 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -103783929, now seen corresponding path program 1 times [2022-04-14 23:29:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:55,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269208587] [2022-04-14 23:29:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:55,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {150911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {150905#true} is VALID [2022-04-14 23:29:55,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {150905#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150905#true} is VALID [2022-04-14 23:29:55,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150905#true} {150905#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150905#true} is VALID [2022-04-14 23:29:55,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {150905#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:55,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {150911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {150905#true} is VALID [2022-04-14 23:29:55,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {150905#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150905#true} is VALID [2022-04-14 23:29:55,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150905#true} {150905#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {150905#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {150905#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {150905#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {150905#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {150905#true} [200] L63-->L63-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[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {150905#true} [202] L63-2-->L67-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[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {150905#true} [204] L67-1-->L71-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[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {150905#true} [206] L71-1-->L75-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[] {150905#true} is VALID [2022-04-14 23:29:55,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {150905#true} [208] L75-1-->L79-1: Formula: (= 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[] {150905#true} is VALID [2022-04-14 23:29:55,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {150905#true} [210] L79-1-->L83-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[] {150905#true} is VALID [2022-04-14 23:29:55,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {150905#true} [212] L83-1-->L87-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[] {150905#true} is VALID [2022-04-14 23:29:55,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {150905#true} [214] L87-1-->L91-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[] {150905#true} is VALID [2022-04-14 23:29:55,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {150905#true} [215] L91-1-->L95-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {150910#(= main_~lk9~0 1)} [218] L95-1-->L101-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {150910#(= main_~lk9~0 1)} [222] L101-1-->L106-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {150910#(= main_~lk9~0 1)} [228] L106-1-->L111-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {150910#(= main_~lk9~0 1)} [232] L111-1-->L116-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {150910#(= main_~lk9~0 1)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {150910#(= main_~lk9~0 1)} [240] L121-1-->L126-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {150910#(= main_~lk9~0 1)} [244] L126-1-->L131-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {150910#(= main_~lk9~0 1)} [248] L131-1-->L136-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[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {150910#(= main_~lk9~0 1)} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {150910#(= main_~lk9~0 1)} is VALID [2022-04-14 23:29:55,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {150910#(= main_~lk9~0 1)} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {150906#false} is VALID [2022-04-14 23:29:55,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {150906#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150906#false} is VALID [2022-04-14 23:29:55,218 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-14 23:29:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269208587] [2022-04-14 23:29:55,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269208587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:55,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:55,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282549815] [2022-04-14 23:29:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:55,220 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-14 23:29:55,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:55,220 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-14 23:29:55,265 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-14 23:29:55,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:55,266 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 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-14 23:29:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:58,465 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-14 23:29:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:58,465 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-14 23:29:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:58,465 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-14 23:29:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-14 23:29:58,466 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-14 23:29:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-14 23:29:58,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2022-04-14 23:29:58,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:30:02,026 INFO L225 Difference]: With dead ends: 10761 [2022-04-14 23:30:02,026 INFO L226 Difference]: Without dead ends: 10761 [2022-04-14 23:30:02,026 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-14 23:30:02,027 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:30:02,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:30:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-14 23:30:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-14 23:30:02,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:30:02,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:30:02,147 INFO L74 IsIncluded]: Start isIncluded. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:30:02,159 INFO L87 Difference]: Start difference. First operand 10761 states. Second operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:30:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:04,931 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-14 23:30:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-14 23:30:04,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:04,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:04,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10761 states. [2022-04-14 23:30:04,953 INFO L87 Difference]: Start difference. First operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 10761 states. [2022-04-14 23:30:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:08,202 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2022-04-14 23:30:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 12423 transitions. [2022-04-14 23:30:08,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:08,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:08,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:30:08,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:30:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:30:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-14 23:30:10,544 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-14 23:30:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:30:10,544 INFO L478 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-14 23:30:10,544 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-14 23:30:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-14 23:30:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:30:10,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:30:10,551 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-14 23:30:10,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 23:30:10,551 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:30:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:30:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash 25298790, now seen corresponding path program 1 times [2022-04-14 23:30:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:30:10,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515346530] [2022-04-14 23:30:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:30:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:30:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:30:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:10,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {193455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193449#true} is VALID [2022-04-14 23:30:10,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {193449#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193449#true} is VALID [2022-04-14 23:30:10,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193449#true} {193449#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193449#true} is VALID [2022-04-14 23:30:10,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {193449#true} [186] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {193455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [188] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {193449#true} [191] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193449#true} {193449#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {193449#true} [187] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {193449#true} [190] mainENTRY-->L141-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p6~0_2 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (<= |v_main_#t~nondet12_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {193449#true} [194] L141-1-->L40: Formula: (and (<= |v_main_#t~nondet13_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648))) InVars {main_#t~nondet13=|v_main_#t~nondet13_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet13, main_~cond~0] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {193449#true} [197] L40-->L63: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_3 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_3, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {193449#true} [200] L63-->L63-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[] {193449#true} is VALID [2022-04-14 23:30:10,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {193449#true} [202] L63-2-->L67-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {193449#true} [204] L67-1-->L71-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {193449#true} [206] L71-1-->L75-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {193449#true} [208] L75-1-->L79-1: Formula: (= 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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {193449#true} [210] L79-1-->L83-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {193449#true} [212] L83-1-->L87-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {193449#true} [214] L87-1-->L91-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[] {193449#true} is VALID [2022-04-14 23:30:10,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {193449#true} [216] L91-1-->L95-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {193454#(= main_~p9~0 0)} [218] L95-1-->L101-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {193454#(= main_~p9~0 0)} [222] L101-1-->L106-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {193454#(= main_~p9~0 0)} [228] L106-1-->L111-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {193454#(= main_~p9~0 0)} [232] L111-1-->L116-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {193454#(= main_~p9~0 0)} [236] L116-1-->L121-1: Formula: (= v_main_~p5~0_1 0) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {193454#(= main_~p9~0 0)} [240] L121-1-->L126-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {193454#(= main_~p9~0 0)} [244] L126-1-->L131-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {193454#(= main_~p9~0 0)} [248] L131-1-->L136-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[] {193454#(= main_~p9~0 0)} is VALID [2022-04-14 23:30:10,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {193454#(= main_~p9~0 0)} [251] L136-1-->L142: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {193450#false} is VALID [2022-04-14 23:30:10,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {193450#false} [253] L142-->L142-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {193450#false} is VALID [2022-04-14 23:30:10,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {193450#false} [223] L142-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193450#false} is VALID [2022-04-14 23:30:10,598 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-14 23:30:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:30:10,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515346530] [2022-04-14 23:30:10,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515346530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:30:10,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:30:10,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:30:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26097402] [2022-04-14 23:30:10,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:30:10,599 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-14 23:30:10,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:30:10,599 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-14 23:30:10,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-14 23:30:10,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:30:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:30:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:30:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:30:10,615 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 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-14 23:30:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:15,563 INFO L93 Difference]: Finished difference Result 12807 states and 14086 transitions. [2022-04-14 23:30:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:30:15,563 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-14 23:30:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:30:15,563 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-14 23:30:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-14 23:30:15,564 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-14 23:30:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-14 23:30:15,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-14 23:30:15,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:30:15,629 INFO L225 Difference]: With dead ends: 12807 [2022-04-14 23:30:15,629 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 23:30:15,630 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-14 23:30:15,630 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:30:15,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:30:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 23:30:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 23:30:15,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:30:15,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:30:15,631 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:30:15,631 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:30:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:15,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:30:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:15,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:15,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:15,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:30:15,631 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:30:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:15,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:30:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:15,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:15,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:15,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:30:15,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:30:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:30:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 23:30:15,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-14 23:30:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:30:15,632 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 23:30:15,632 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-14 23:30:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:15,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:15,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 23:30:15,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 23:30:15,637 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:30:15,638 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 23:30:15,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:30:15 BasicIcfg [2022-04-14 23:30:15,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 23:30:15,641 INFO L158 Benchmark]: Toolchain (without parser) took 54160.04ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 119.6MB in the beginning and 126.8MB in the end (delta: -7.2MB). Peak memory consumption was 117.9MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,641 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:30:15,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.50ms. Allocated memory is still 168.8MB. Free memory was 119.4MB in the beginning and 143.6MB in the end (delta: -24.2MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,642 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 168.8MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,642 INFO L158 Benchmark]: RCFGBuilder took 393.93ms. Allocated memory is still 168.8MB. Free memory was 142.0MB in the beginning and 127.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,642 INFO L158 Benchmark]: IcfgTransformer took 47.89ms. Allocated memory is still 168.8MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,642 INFO L158 Benchmark]: TraceAbstraction took 53415.65ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 125.2MB in the beginning and 126.8MB in the end (delta: -1.6MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. [2022-04-14 23:30:15,643 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.50ms. Allocated memory is still 168.8MB. Free memory was 119.4MB in the beginning and 143.6MB in the end (delta: -24.2MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 168.8MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.93ms. Allocated memory is still 168.8MB. Free memory was 142.0MB in the beginning and 127.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 47.89ms. Allocated memory is still 168.8MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 53415.65ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 125.2MB in the beginning and 126.8MB in the end (delta: -1.6MB). Peak memory consumption was 123.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2874 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2874 mSDsluCounter, 2142 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1965 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 23:30:15,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...