/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:17:10,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:17:10,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:17:10,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:17:10,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:17:10,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:17:10,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:17:10,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:17:10,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:17:10,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:17:10,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:17:10,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:17:10,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:17:10,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:17:10,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:17:10,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:17:10,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:17:10,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:17:10,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:17:10,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:17:10,773 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:17:10,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:17:10,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:17:10,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:17:10,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:17:10,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:17:10,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:17:10,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:17:10,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:17:10,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:17:10,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:17:10,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:17:10,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:17:10,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:17:10,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:17:10,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:17:10,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:17:10,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:17:10,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:17:10,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:17:10,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:17:10,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:17:10,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:17:10,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:17:10,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:17:10,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:17:10,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:17:10,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:17:10,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:10,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:17:10,798 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:17:10,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:17:10,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:17:10,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:17:10,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:17:10,983 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:17:10,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-15 11:17:11,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4997a31/7bfee0ca981e4201a7e44b0eeed6818b/FLAG508cb1064 [2022-04-15 11:17:11,442 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:17:11,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-15 11:17:11,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4997a31/7bfee0ca981e4201a7e44b0eeed6818b/FLAG508cb1064 [2022-04-15 11:17:11,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4997a31/7bfee0ca981e4201a7e44b0eeed6818b [2022-04-15 11:17:11,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:17:11,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:17:11,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:11,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:17:11,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:17:11,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d12d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11, skipping insertion in model container [2022-04-15 11:17:11,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:17:11,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:17:11,692 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_14-1.c[5283,5296] [2022-04-15 11:17:11,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:11,716 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:17:11,749 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_14-1.c[5283,5296] [2022-04-15 11:17:11,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:17:11,760 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:17:11,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11 WrapperNode [2022-04-15 11:17:11,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:17:11,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:17:11,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:17:11,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:17:11,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:17:11,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:17:11,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:17:11,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:17:11,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (1/1) ... [2022-04-15 11:17:11,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:17:11,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:17:11,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:17:11,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:17:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:17:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:17:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:17:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:17:11,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:17:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:17:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:17:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:17:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:17:11,896 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:17:11,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:17:12,084 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:17:12,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:17:12,091 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:17:12,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:12 BoogieIcfgContainer [2022-04-15 11:17:12,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:17:12,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:17:12,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:17:12,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:17:12,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:17:11" (1/3) ... [2022-04-15 11:17:12,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639def39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:12, skipping insertion in model container [2022-04-15 11:17:12,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:17:11" (2/3) ... [2022-04-15 11:17:12,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639def39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:17:12, skipping insertion in model container [2022-04-15 11:17:12,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:17:12" (3/3) ... [2022-04-15 11:17:12,102 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-15 11:17:12,105 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:17:12,105 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:17:12,143 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:17:12,146 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-15 11:17:12,147 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:17:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:17:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:12,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:12,168 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:12,169 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-15 11:17:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1421079960] [2022-04-15 11:17:12,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 2 times [2022-04-15 11:17:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:12,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638632749] [2022-04-15 11:17:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:12,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-15 11:17:12,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-15 11:17:12,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-15 11:17:12,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:12,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-15 11:17:12,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-15 11:17:12,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-15 11:17:12,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-15 11:17:12,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-15 11:17:12,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-15 11:17:12,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-15 11:17:12,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-15 11:17:12,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-15 11:17:12,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-15 11:17:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638632749] [2022-04-15 11:17:12,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638632749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1421079960] [2022-04-15 11:17:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1421079960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:12,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:12,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716391226] [2022-04-15 11:17:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:12,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:12,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:12,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:12,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:12,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:12,540 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:12,915 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-15 11:17:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 11:17:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 11:17:12,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-15 11:17:13,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,076 INFO L225 Difference]: With dead ends: 112 [2022-04-15 11:17:13,076 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 11:17:13,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:13,080 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:13,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 11:17:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-15 11:17:13,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,107 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,107 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,112 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-15 11:17:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-15 11:17:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-15 11:17:13,113 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-15 11:17:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,117 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-15 11:17:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-15 11:17:13,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-15 11:17:13,124 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-15 11:17:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,125 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-15 11:17:13,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 122 transitions. [2022-04-15 11:17:13,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-15 11:17:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 11:17:13,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:13,255 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:13,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:17:13,255 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-15 11:17:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201615038] [2022-04-15 11:17:13,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 2 times [2022-04-15 11:17:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310715800] [2022-04-15 11:17:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:13,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-15 11:17:13,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-15 11:17:13,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-15 11:17:13,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:13,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-15 11:17:13,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-15 11:17:13,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #268#return; {624#true} is VALID [2022-04-15 11:17:13,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret19 := main(); {624#true} is VALID [2022-04-15 11:17:13,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {624#true} is VALID [2022-04-15 11:17:13,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {624#true} is VALID [2022-04-15 11:17:13,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {624#true} is VALID [2022-04-15 11:17:13,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} assume !(0 != ~p1~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p2~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(= main_~p1~0 0)} assume !(0 != ~p10~0); {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {629#(= main_~p1~0 0)} is VALID [2022-04-15 11:17:13,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {629#(= main_~p1~0 0)} assume 0 != ~p1~0; {625#false} is VALID [2022-04-15 11:17:13,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#false} assume 1 != ~lk1~0; {625#false} is VALID [2022-04-15 11:17:13,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-15 11:17:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310715800] [2022-04-15 11:17:13,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310715800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:13,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201615038] [2022-04-15 11:17:13,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201615038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:13,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:13,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630371010] [2022-04-15 11:17:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:13,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:13,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:13,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:13,387 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,701 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-15 11:17:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 11:17:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 11:17:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-15 11:17:13,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-15 11:17:13,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:13,895 INFO L225 Difference]: With dead ends: 158 [2022-04-15 11:17:13,895 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 11:17:13,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:13,897 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:13,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 11:17:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-15 11:17:13,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:13,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,907 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,908 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,911 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-15 11:17:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-15 11:17:13,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-15 11:17:13,912 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-15 11:17:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:13,915 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-15 11:17:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-15 11:17:13,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:13,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:13,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:13,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-15 11:17:13,919 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-15 11:17:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:13,919 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-15 11:17:13,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:13,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 174 transitions. [2022-04-15 11:17:14,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-15 11:17:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:14,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,044 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:14,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:17:14,044 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-15 11:17:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216209044] [2022-04-15 11:17:14,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 2 times [2022-04-15 11:17:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777723526] [2022-04-15 11:17:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-15 11:17:14,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-15 11:17:14,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-15 11:17:14,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:14,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1336#true} is VALID [2022-04-15 11:17:14,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {1336#true} assume true; {1336#true} is VALID [2022-04-15 11:17:14,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1336#true} {1336#true} #268#return; {1336#true} is VALID [2022-04-15 11:17:14,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {1336#true} call #t~ret19 := main(); {1336#true} is VALID [2022-04-15 11:17:14,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {1336#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {1336#true} is VALID [2022-04-15 11:17:14,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1336#true} is VALID [2022-04-15 11:17:14,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1336#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1336#true} is VALID [2022-04-15 11:17:14,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1336#true} assume 0 != ~p1~0;~lk1~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {1341#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {1341#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:17:14,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {1341#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1337#false} is VALID [2022-04-15 11:17:14,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#false} assume 0 != ~p2~0; {1337#false} is VALID [2022-04-15 11:17:14,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2022-04-15 11:17:14,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2022-04-15 11:17:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:14,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:14,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777723526] [2022-04-15 11:17:14,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777723526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:14,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216209044] [2022-04-15 11:17:14,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216209044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397167950] [2022-04-15 11:17:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:14,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:14,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:14,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:14,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:14,109 INFO L87 Difference]: Start difference. First operand 95 states and 174 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,316 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-15 11:17:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 11:17:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-15 11:17:14,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-15 11:17:14,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,480 INFO L225 Difference]: With dead ends: 145 [2022-04-15 11:17:14,480 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 11:17:14,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:14,481 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:14,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 11:17:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-15 11:17:14,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:14,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,490 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,490 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,493 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-15 11:17:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-15 11:17:14,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-15 11:17:14,494 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-15 11:17:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,496 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-15 11:17:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-15 11:17:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:14,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:14,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-15 11:17:14,499 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-15 11:17:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:14,499 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-15 11:17:14,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 176 transitions. [2022-04-15 11:17:14,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-15 11:17:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:14,626 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:14,626 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:14,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:17:14,627 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-15 11:17:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353505959] [2022-04-15 11:17:14,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 2 times [2022-04-15 11:17:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834252741] [2022-04-15 11:17:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:14,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-15 11:17:14,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-15 11:17:14,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-15 11:17:14,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:14,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2034#true} is VALID [2022-04-15 11:17:14,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2022-04-15 11:17:14,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #268#return; {2034#true} is VALID [2022-04-15 11:17:14,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret19 := main(); {2034#true} is VALID [2022-04-15 11:17:14,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {2034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {2034#true} is VALID [2022-04-15 11:17:14,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2034#true} is VALID [2022-04-15 11:17:14,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {2034#true} is VALID [2022-04-15 11:17:14,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#true} assume !(0 != ~p1~0); {2034#true} is VALID [2022-04-15 11:17:14,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#true} assume !(0 != ~p2~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p10~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {2039#(= main_~p2~0 0)} assume !(0 != ~p1~0); {2039#(= main_~p2~0 0)} is VALID [2022-04-15 11:17:14,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {2039#(= main_~p2~0 0)} assume 0 != ~p2~0; {2035#false} is VALID [2022-04-15 11:17:14,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {2035#false} assume 1 != ~lk2~0; {2035#false} is VALID [2022-04-15 11:17:14,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2022-04-15 11:17:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:14,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834252741] [2022-04-15 11:17:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834252741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:14,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353505959] [2022-04-15 11:17:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353505959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:14,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289707802] [2022-04-15 11:17:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:14,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:14,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:14,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:14,727 INFO L87 Difference]: Start difference. First operand 98 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:14,917 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-15 11:17:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 11:17:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-15 11:17:14,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-15 11:17:15,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,091 INFO L225 Difference]: With dead ends: 274 [2022-04-15 11:17:15,092 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 11:17:15,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:15,093 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 11:17:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-15 11:17:15,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,108 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,108 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,112 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-15 11:17:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-15 11:17:15,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-15 11:17:15,113 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 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 185 states. [2022-04-15 11:17:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,117 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-15 11:17:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-15 11:17:15,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-15 11:17:15,122 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-15 11:17:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,122 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-15 11:17:15,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 333 transitions. [2022-04-15 11:17:15,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-15 11:17:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:17:15,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:15,395 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:15,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:17:15,396 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-15 11:17:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821618374] [2022-04-15 11:17:15,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 2 times [2022-04-15 11:17:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:15,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996891428] [2022-04-15 11:17:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:15,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-15 11:17:15,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-15 11:17:15,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {3330#true} call ULTIMATE.init(); {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:15,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {3330#true} assume true; {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3330#true} {3330#true} #268#return; {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {3330#true} call #t~ret19 := main(); {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {3330#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {3330#true} is VALID [2022-04-15 11:17:15,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {3330#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3330#true} is VALID [2022-04-15 11:17:15,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {3330#true} is VALID [2022-04-15 11:17:15,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {3330#true} assume !(0 != ~p1~0); {3330#true} is VALID [2022-04-15 11:17:15,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#true} assume 0 != ~p2~0;~lk2~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {3335#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(= main_~lk2~0 1)} assume 0 != ~p2~0; {3335#(= main_~lk2~0 1)} is VALID [2022-04-15 11:17:15,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {3331#false} is VALID [2022-04-15 11:17:15,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {3331#false} assume !false; {3331#false} is VALID [2022-04-15 11:17:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:15,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996891428] [2022-04-15 11:17:15,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996891428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:15,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821618374] [2022-04-15 11:17:15,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821618374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:15,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:15,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444683006] [2022-04-15 11:17:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:15,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:15,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:15,492 INFO L87 Difference]: Start difference. First operand 183 states and 333 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,698 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-15 11:17:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 11:17:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 11:17:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-15 11:17:15,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-15 11:17:15,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:15,811 INFO L225 Difference]: With dead ends: 239 [2022-04-15 11:17:15,811 INFO L226 Difference]: Without dead ends: 237 [2022-04-15 11:17:15,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:15,812 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:15,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:15,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-15 11:17:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-15 11:17:15,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:15,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,823 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,823 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,828 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-15 11:17:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-15 11:17:15,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-15 11:17:15,830 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-15 11:17:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:15,835 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-15 11:17:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-15 11:17:15,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:15,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:15,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:15,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-15 11:17:15,839 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-15 11:17:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:15,839 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-15 11:17:15,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:15,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 331 transitions. [2022-04-15 11:17:16,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-15 11:17:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:16,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:16,091 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-15 11:17:16,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:17:16,091 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-15 11:17:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398539742] [2022-04-15 11:17:16,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 2 times [2022-04-15 11:17:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159253161] [2022-04-15 11:17:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-15 11:17:16,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-15 11:17:16,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-15 11:17:16,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #268#return; {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret19 := main(); {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {4660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {4660#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {4660#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {4660#true} assume !(0 != ~p1~0); {4660#true} is VALID [2022-04-15 11:17:16,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {4660#true} assume !(0 != ~p2~0); {4660#true} is VALID [2022-04-15 11:17:16,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {4660#true} assume 0 != ~p3~0;~lk3~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {4665#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {4665#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4665#(= main_~lk3~0 1)} is VALID [2022-04-15 11:17:16,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {4665#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4661#false} is VALID [2022-04-15 11:17:16,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2022-04-15 11:17:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:16,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159253161] [2022-04-15 11:17:16,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159253161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:16,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398539742] [2022-04-15 11:17:16,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398539742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950545861] [2022-04-15 11:17:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:16,141 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-15 11:17:16,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:16,141 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-15 11:17:16,155 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-15 11:17:16,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:16,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:16,155 INFO L87 Difference]: Start difference. First operand 183 states and 331 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-15 11:17:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,364 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-15 11:17:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:16,364 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-15 11:17:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:16,364 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-15 11:17:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:17:16,365 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-15 11:17:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-15 11:17:16,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-15 11:17:16,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,481 INFO L225 Difference]: With dead ends: 347 [2022-04-15 11:17:16,481 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 11:17:16,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:16,482 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:16,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 11:17:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-15 11:17:16,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:16,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,496 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,496 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,502 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-15 11:17:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-15 11:17:16,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-15 11:17:16,504 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-15 11:17:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:16,510 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-15 11:17:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-15 11:17:16,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:16,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:16,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:16,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-15 11:17:16,515 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-15 11:17:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:16,515 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-15 11:17:16,515 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-15 11:17:16,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 445 transitions. [2022-04-15 11:17:16,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-15 11:17:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 11:17:16,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:16,864 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-15 11:17:16,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:17:16,864 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-15 11:17:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1627497206] [2022-04-15 11:17:16,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 2 times [2022-04-15 11:17:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:16,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660688245] [2022-04-15 11:17:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:16,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {6550#true} call ULTIMATE.init(); {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:16,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {6550#true} assume true; {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6550#true} {6550#true} #268#return; {6550#true} is VALID [2022-04-15 11:17:16,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {6550#true} call #t~ret19 := main(); {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {6550#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {6550#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {6550#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {6550#true} assume !(0 != ~p1~0); {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {6550#true} assume !(0 != ~p2~0); {6550#true} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {6550#true} assume !(0 != ~p3~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p10~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p1~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(= main_~p3~0 0)} assume !(0 != ~p2~0); {6555#(= main_~p3~0 0)} is VALID [2022-04-15 11:17:16,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {6555#(= main_~p3~0 0)} assume 0 != ~p3~0; {6551#false} is VALID [2022-04-15 11:17:16,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {6551#false} assume 1 != ~lk3~0; {6551#false} is VALID [2022-04-15 11:17:16,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {6551#false} assume !false; {6551#false} is VALID [2022-04-15 11:17:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:16,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660688245] [2022-04-15 11:17:16,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660688245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:16,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1627497206] [2022-04-15 11:17:16,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1627497206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:16,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:16,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854477789] [2022-04-15 11:17:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:16,936 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-15 11:17:16,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:16,936 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-15 11:17:16,950 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-15 11:17:16,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:16,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:16,950 INFO L87 Difference]: Start difference. First operand 247 states and 445 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-15 11:17:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,150 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-15 11:17:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 11:17:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:17,151 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-15 11:17:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 11:17:17,152 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-15 11:17:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-15 11:17:17,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-15 11:17:17,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,302 INFO L225 Difference]: With dead ends: 591 [2022-04-15 11:17:17,302 INFO L226 Difference]: Without dead ends: 353 [2022-04-15 11:17:17,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:17,304 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:17,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-15 11:17:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-15 11:17:17,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:17,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,323 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,324 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,330 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-15 11:17:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-15 11:17:17,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 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 353 states. [2022-04-15 11:17:17,332 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 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 353 states. [2022-04-15 11:17:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:17,338 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-15 11:17:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-15 11:17:17,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:17,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:17,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:17,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-15 11:17:17,346 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-15 11:17:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:17,346 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-15 11:17:17,346 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-15 11:17:17,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 351 states and 631 transitions. [2022-04-15 11:17:17,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-15 11:17:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:17,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:17,848 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-15 11:17:17,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:17:17,848 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-15 11:17:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496035854] [2022-04-15 11:17:17,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 2 times [2022-04-15 11:17:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:17,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44884300] [2022-04-15 11:17:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:17,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-15 11:17:17,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 11:17:17,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-15 11:17:17,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:17,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {9158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9152#true} {9152#true} #268#return; {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {9152#true} call #t~ret19 := main(); {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {9152#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {9152#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 != ~p1~0); {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume !(0 != ~p2~0); {9152#true} is VALID [2022-04-15 11:17:17,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {9152#true} assume 0 != ~p3~0;~lk3~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {9157#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {9157#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:17:17,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {9157#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {9153#false} is VALID [2022-04-15 11:17:17,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {9153#false} assume 0 != ~p4~0; {9153#false} is VALID [2022-04-15 11:17:17,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {9153#false} assume 1 != ~lk4~0; {9153#false} is VALID [2022-04-15 11:17:17,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 11:17:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:17,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44884300] [2022-04-15 11:17:17,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44884300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:17,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496035854] [2022-04-15 11:17:17,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496035854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:17,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:17,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204319602] [2022-04-15 11:17:17,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:17,897 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-15 11:17:17,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:17,897 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-15 11:17:17,911 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-15 11:17:17,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:17,912 INFO L87 Difference]: Start difference. First operand 351 states and 631 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-15 11:17:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,105 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-15 11:17:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:18,106 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-15 11:17:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:18,106 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-15 11:17:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 11:17:18,108 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-15 11:17:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-15 11:17:18,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-15 11:17:18,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,250 INFO L225 Difference]: With dead ends: 529 [2022-04-15 11:17:18,250 INFO L226 Difference]: Without dead ends: 359 [2022-04-15 11:17:18,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:18,251 INFO L913 BasicCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:18,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-15 11:17:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-15 11:17:18,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:18,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,277 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,277 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,283 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-15 11:17:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-15 11:17:18,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:18,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:18,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-15 11:17:18,285 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-15 11:17:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:18,291 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-15 11:17:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-15 11:17:18,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:18,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:18,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:18,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-15 11:17:18,299 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-15 11:17:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:18,299 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-15 11:17:18,299 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-15 11:17:18,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 635 transitions. [2022-04-15 11:17:18,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-15 11:17:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:18,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:18,824 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-15 11:17:18,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:17:18,824 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-15 11:17:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204839679] [2022-04-15 11:17:18,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 2 times [2022-04-15 11:17:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731307676] [2022-04-15 11:17:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:18,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-15 11:17:18,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-15 11:17:18,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {11654#true} call ULTIMATE.init(); {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {11660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {11654#true} assume true; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11654#true} {11654#true} #268#return; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {11654#true} call #t~ret19 := main(); {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {11654#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {11654#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {11654#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {11654#true} assume !(0 != ~p1~0); {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {11654#true} assume !(0 != ~p2~0); {11654#true} is VALID [2022-04-15 11:17:18,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {11654#true} assume !(0 != ~p3~0); {11654#true} is VALID [2022-04-15 11:17:18,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {11654#true} assume 0 != ~p4~0;~lk4~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {11659#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {11659#(= main_~lk4~0 1)} assume 0 != ~p4~0; {11659#(= main_~lk4~0 1)} is VALID [2022-04-15 11:17:18,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {11659#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {11655#false} is VALID [2022-04-15 11:17:18,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {11655#false} assume !false; {11655#false} is VALID [2022-04-15 11:17:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731307676] [2022-04-15 11:17:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731307676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204839679] [2022-04-15 11:17:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204839679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:18,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690387017] [2022-04-15 11:17:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:18,878 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-15 11:17:18,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:18,878 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-15 11:17:18,892 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-15 11:17:18,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:18,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:18,893 INFO L87 Difference]: Start difference. First operand 357 states and 635 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-15 11:17:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,094 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-15 11:17:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:19,095 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-15 11:17:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:19,095 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-15 11:17:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 11:17:19,096 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-15 11:17:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-15 11:17:19,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-15 11:17:19,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:19,218 INFO L225 Difference]: With dead ends: 669 [2022-04-15 11:17:19,218 INFO L226 Difference]: Without dead ends: 667 [2022-04-15 11:17:19,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:19,219 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:19,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-15 11:17:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-15 11:17:19,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:19,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,243 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,243 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,259 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-15 11:17:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-15 11:17:19,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-15 11:17:19,261 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-15 11:17:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:19,276 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-15 11:17:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-15 11:17:19,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:19,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:19,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:19,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-15 11:17:19,290 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-15 11:17:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:19,290 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-15 11:17:19,290 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-15 11:17:19,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 859 transitions. [2022-04-15 11:17:19,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 859 edges. 859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-15 11:17:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 11:17:19,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:19,971 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-15 11:17:19,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:17:19,972 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-15 11:17:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:19,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471871794] [2022-04-15 11:17:19,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 2 times [2022-04-15 11:17:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:19,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037192499] [2022-04-15 11:17:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:20,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-15 11:17:20,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-15 11:17:20,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {15322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #268#return; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret19 := main(); {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {15316#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {15316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !(0 != ~p1~0); {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !(0 != ~p2~0); {15316#true} is VALID [2022-04-15 11:17:20,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !(0 != ~p3~0); {15316#true} is VALID [2022-04-15 11:17:20,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !(0 != ~p4~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p10~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p1~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p2~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {15321#(= main_~p4~0 0)} assume !(0 != ~p3~0); {15321#(= main_~p4~0 0)} is VALID [2022-04-15 11:17:20,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {15321#(= main_~p4~0 0)} assume 0 != ~p4~0; {15317#false} is VALID [2022-04-15 11:17:20,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {15317#false} assume 1 != ~lk4~0; {15317#false} is VALID [2022-04-15 11:17:20,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2022-04-15 11:17:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:20,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037192499] [2022-04-15 11:17:20,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037192499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:20,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471871794] [2022-04-15 11:17:20,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471871794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:20,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:20,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906736067] [2022-04-15 11:17:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:20,030 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-15 11:17:20,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:20,030 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-15 11:17:20,044 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-15 11:17:20,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:20,044 INFO L87 Difference]: Start difference. First operand 489 states and 859 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-15 11:17:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,310 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-15 11:17:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:20,311 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-15 11:17:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:20,311 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-15 11:17:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-15 11:17:20,313 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-15 11:17:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-15 11:17:20,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-15 11:17:20,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:20,481 INFO L225 Difference]: With dead ends: 1165 [2022-04-15 11:17:20,481 INFO L226 Difference]: Without dead ends: 691 [2022-04-15 11:17:20,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:20,482 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:20,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-15 11:17:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-15 11:17:20,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:20,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,517 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,517 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,533 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-15 11:17:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-15 11:17:20,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-15 11:17:20,536 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-15 11:17:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:20,552 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-15 11:17:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-15 11:17:20,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:20,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:20,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:20,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-15 11:17:20,573 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-15 11:17:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:20,573 INFO L478 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-15 11:17:20,573 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-15 11:17:20,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 689 states and 1207 transitions. [2022-04-15 11:17:21,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-15 11:17:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:21,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:21,625 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:21,626 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:17:21,626 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-15 11:17:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:21,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387171008] [2022-04-15 11:17:21,626 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 2 times [2022-04-15 11:17:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:21,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88670161] [2022-04-15 11:17:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:21,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:21,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-15 11:17:21,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 11:17:21,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #268#return; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret19 := main(); {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {20418#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {20418#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {20418#true} assume !(0 != ~p1~0); {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {20418#true} assume !(0 != ~p2~0); {20418#true} is VALID [2022-04-15 11:17:21,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {20418#true} assume !(0 != ~p3~0); {20418#true} is VALID [2022-04-15 11:17:21,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {20418#true} assume 0 != ~p4~0;~lk4~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {20423#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:17:21,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {20423#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {20419#false} is VALID [2022-04-15 11:17:21,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {20419#false} assume 0 != ~p5~0; {20419#false} is VALID [2022-04-15 11:17:21,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {20419#false} assume 1 != ~lk5~0; {20419#false} is VALID [2022-04-15 11:17:21,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-15 11:17:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88670161] [2022-04-15 11:17:21,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88670161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:21,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:21,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:21,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [387171008] [2022-04-15 11:17:21,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [387171008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:21,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:21,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202461806] [2022-04-15 11:17:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:21,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:21,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:21,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:21,686 INFO L87 Difference]: Start difference. First operand 689 states and 1207 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:21,933 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-15 11:17:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-15 11:17:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-15 11:17:21,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-15 11:17:22,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:22,138 INFO L225 Difference]: With dead ends: 1033 [2022-04-15 11:17:22,138 INFO L226 Difference]: Without dead ends: 699 [2022-04-15 11:17:22,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:22,139 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:22,139 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-15 11:17:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-15 11:17:22,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:22,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,174 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,175 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,191 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-15 11:17:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-15 11:17:22,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-15 11:17:22,194 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 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 699 states. [2022-04-15 11:17:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:22,210 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-15 11:17:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-15 11:17:22,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:22,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:22,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:22,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-15 11:17:22,231 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-15 11:17:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:22,231 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-15 11:17:22,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:22,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 1207 transitions. [2022-04-15 11:17:23,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-15 11:17:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:23,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:23,274 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:23,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:17:23,274 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-15 11:17:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714714444] [2022-04-15 11:17:23,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 2 times [2022-04-15 11:17:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:23,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385105906] [2022-04-15 11:17:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:23,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {25288#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {25288#true} assume true; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25288#true} {25288#true} #268#return; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {25288#true} call #t~ret19 := main(); {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {25288#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {25288#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {25288#true} is VALID [2022-04-15 11:17:23,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {25288#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {25288#true} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {25288#true} assume !(0 != ~p1~0); {25288#true} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {25288#true} assume !(0 != ~p2~0); {25288#true} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#true} assume !(0 != ~p3~0); {25288#true} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {25288#true} assume !(0 != ~p4~0); {25288#true} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {25288#true} assume 0 != ~p5~0;~lk5~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {25293#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {25293#(= main_~lk5~0 1)} assume 0 != ~p5~0; {25293#(= main_~lk5~0 1)} is VALID [2022-04-15 11:17:23,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {25293#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {25289#false} is VALID [2022-04-15 11:17:23,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {25289#false} assume !false; {25289#false} is VALID [2022-04-15 11:17:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385105906] [2022-04-15 11:17:23,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385105906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714714444] [2022-04-15 11:17:23,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714714444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:23,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:23,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618011918] [2022-04-15 11:17:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:23,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:23,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:23,332 INFO L87 Difference]: Start difference. First operand 697 states and 1207 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:23,619 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-15 11:17:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:23,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:17:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-15 11:17:23,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-15 11:17:23,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:23,796 INFO L225 Difference]: With dead ends: 1293 [2022-04-15 11:17:23,796 INFO L226 Difference]: Without dead ends: 1291 [2022-04-15 11:17:23,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:23,798 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:23,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-15 11:17:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-15 11:17:23,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:23,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,853 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,854 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:23,902 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-15 11:17:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-15 11:17:23,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:23,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:23,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-15 11:17:23,907 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-15 11:17:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:23,953 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-15 11:17:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-15 11:17:23,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:23,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:23,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:23,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-15 11:17:23,994 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-15 11:17:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:23,995 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-15 11:17:23,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:23,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 969 states and 1647 transitions. [2022-04-15 11:17:25,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1647 edges. 1647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-15 11:17:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 11:17:25,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:25,392 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:25,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:17:25,392 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-15 11:17:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:25,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [744955351] [2022-04-15 11:17:25,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:25,393 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 2 times [2022-04-15 11:17:25,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:25,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349429156] [2022-04-15 11:17:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:25,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-15 11:17:25,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-15 11:17:25,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {32406#true} call ULTIMATE.init(); {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {32412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {32406#true} assume true; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32406#true} {32406#true} #268#return; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {32406#true} call #t~ret19 := main(); {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {32406#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {32406#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {32406#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {32406#true} is VALID [2022-04-15 11:17:25,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {32406#true} assume !(0 != ~p1~0); {32406#true} is VALID [2022-04-15 11:17:25,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {32406#true} assume !(0 != ~p2~0); {32406#true} is VALID [2022-04-15 11:17:25,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {32406#true} assume !(0 != ~p3~0); {32406#true} is VALID [2022-04-15 11:17:25,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {32406#true} assume !(0 != ~p4~0); {32406#true} is VALID [2022-04-15 11:17:25,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {32406#true} assume !(0 != ~p5~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p10~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p1~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p2~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p3~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {32411#(= main_~p5~0 0)} assume !(0 != ~p4~0); {32411#(= main_~p5~0 0)} is VALID [2022-04-15 11:17:25,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {32411#(= main_~p5~0 0)} assume 0 != ~p5~0; {32407#false} is VALID [2022-04-15 11:17:25,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {32407#false} assume 1 != ~lk5~0; {32407#false} is VALID [2022-04-15 11:17:25,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {32407#false} assume !false; {32407#false} is VALID [2022-04-15 11:17:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349429156] [2022-04-15 11:17:25,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349429156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:25,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:25,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [744955351] [2022-04-15 11:17:25,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [744955351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:25,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:25,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308670455] [2022-04-15 11:17:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:25,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:25,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:25,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:25,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:25,456 INFO L87 Difference]: Start difference. First operand 969 states and 1647 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:25,920 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-15 11:17:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 11:17:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-15 11:17:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-15 11:17:25,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-15 11:17:26,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:26,138 INFO L225 Difference]: With dead ends: 2301 [2022-04-15 11:17:26,138 INFO L226 Difference]: Without dead ends: 1355 [2022-04-15 11:17:26,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:26,140 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:26,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:17:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-15 11:17:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-15 11:17:26,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:26,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,217 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,218 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,265 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-15 11:17:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-15 11:17:26,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:26,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:26,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-15 11:17:26,269 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-15 11:17:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:26,317 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-15 11:17:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-15 11:17:26,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:26,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:26,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:26,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-15 11:17:26,399 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-15 11:17:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:26,399 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-15 11:17:26,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:26,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 2295 transitions. [2022-04-15 11:17:28,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-15 11:17:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:17:28,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:28,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:28,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:17:28,391 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-15 11:17:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480005474] [2022-04-15 11:17:28,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 2 times [2022-04-15 11:17:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:28,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098597905] [2022-04-15 11:17:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:28,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:28,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {42436#true} call ULTIMATE.init(); {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:28,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {42442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {42436#true} assume true; {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42436#true} {42436#true} #268#return; {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {42436#true} call #t~ret19 := main(); {42436#true} is VALID [2022-04-15 11:17:28,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {42436#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {42436#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {42436#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {42436#true} assume !(0 != ~p1~0); {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {42436#true} assume !(0 != ~p2~0); {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {42436#true} assume !(0 != ~p3~0); {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {42436#true} assume !(0 != ~p4~0); {42436#true} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {42436#true} assume 0 != ~p5~0;~lk5~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {42441#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {42441#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:17:28,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {42441#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {42437#false} is VALID [2022-04-15 11:17:28,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {42437#false} assume 0 != ~p6~0; {42437#false} is VALID [2022-04-15 11:17:28,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {42437#false} assume 1 != ~lk6~0; {42437#false} is VALID [2022-04-15 11:17:28,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {42437#false} assume !false; {42437#false} is VALID [2022-04-15 11:17:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098597905] [2022-04-15 11:17:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098597905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:28,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:28,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:28,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480005474] [2022-04-15 11:17:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480005474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:28,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:28,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735348250] [2022-04-15 11:17:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:28,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:28,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:28,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:28,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:28,463 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:28,869 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-15 11:17:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-15 11:17:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-15 11:17:28,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-15 11:17:29,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:29,088 INFO L225 Difference]: With dead ends: 2029 [2022-04-15 11:17:29,088 INFO L226 Difference]: Without dead ends: 1371 [2022-04-15 11:17:29,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:29,090 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:29,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-15 11:17:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-15 11:17:29,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:29,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,178 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,179 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:29,227 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-15 11:17:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-15 11:17:29,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:29,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:29,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-15 11:17:29,232 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-15 11:17:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:29,280 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-15 11:17:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-15 11:17:29,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:29,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:29,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:29,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-15 11:17:29,354 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-15 11:17:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:29,354 INFO L478 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-15 11:17:29,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:29,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1369 states and 2295 transitions. [2022-04-15 11:17:31,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2295 edges. 2295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-15 11:17:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:17:31,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:31,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:31,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:17:31,368 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:31,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-15 11:17:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:31,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655290757] [2022-04-15 11:17:31,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 2 times [2022-04-15 11:17:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:31,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060999261] [2022-04-15 11:17:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:31,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-15 11:17:31,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-15 11:17:31,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-15 11:17:31,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {51986#true} call ULTIMATE.init(); {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:31,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {51992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {51986#true} is VALID [2022-04-15 11:17:31,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {51986#true} assume true; {51986#true} is VALID [2022-04-15 11:17:31,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51986#true} {51986#true} #268#return; {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {51986#true} call #t~ret19 := main(); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {51986#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {51986#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {51986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {51986#true} assume !(0 != ~p1~0); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {51986#true} assume !(0 != ~p2~0); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {51986#true} assume !(0 != ~p3~0); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {51986#true} assume !(0 != ~p4~0); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {51986#true} assume !(0 != ~p5~0); {51986#true} is VALID [2022-04-15 11:17:31,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {51986#true} assume 0 != ~p6~0;~lk6~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {51991#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {51991#(= main_~lk6~0 1)} assume 0 != ~p6~0; {51991#(= main_~lk6~0 1)} is VALID [2022-04-15 11:17:31,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {51991#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {51987#false} is VALID [2022-04-15 11:17:31,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {51987#false} assume !false; {51987#false} is VALID [2022-04-15 11:17:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:31,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:31,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060999261] [2022-04-15 11:17:31,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060999261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:31,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:31,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:31,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:31,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655290757] [2022-04-15 11:17:31,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655290757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:31,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:31,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:31,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87584392] [2022-04-15 11:17:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:31,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:31,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:31,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:31,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:31,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:31,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:31,454 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:32,015 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-15 11:17:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:17:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-15 11:17:32,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-15 11:17:32,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:32,369 INFO L225 Difference]: With dead ends: 2509 [2022-04-15 11:17:32,369 INFO L226 Difference]: Without dead ends: 2507 [2022-04-15 11:17:32,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:32,370 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:32,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-15 11:17:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-15 11:17:32,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:32,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,488 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,490 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:32,649 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-15 11:17:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-15 11:17:32,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:32,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:32,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-15 11:17:32,655 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-15 11:17:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:32,815 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-15 11:17:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-15 11:17:32,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:32,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:32,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:32,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-15 11:17:32,970 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-15 11:17:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:32,970 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-15 11:17:32,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:32,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1929 states and 3159 transitions. [2022-04-15 11:17:35,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3159 edges. 3159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-15 11:17:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:17:35,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:35,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:35,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:17:35,765 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-15 11:17:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:35,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528793071] [2022-04-15 11:17:35,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 2 times [2022-04-15 11:17:35,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:35,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714159622] [2022-04-15 11:17:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:35,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:35,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-15 11:17:35,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-15 11:17:35,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-15 11:17:35,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {65888#true} call ULTIMATE.init(); {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:35,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {65894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {65888#true} is VALID [2022-04-15 11:17:35,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {65888#true} assume true; {65888#true} is VALID [2022-04-15 11:17:35,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65888#true} {65888#true} #268#return; {65888#true} is VALID [2022-04-15 11:17:35,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {65888#true} call #t~ret19 := main(); {65888#true} is VALID [2022-04-15 11:17:35,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {65888#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {65888#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {65888#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {65888#true} assume !(0 != ~p1~0); {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {65888#true} assume !(0 != ~p2~0); {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {65888#true} assume !(0 != ~p3~0); {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {65888#true} assume !(0 != ~p4~0); {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {65888#true} assume !(0 != ~p5~0); {65888#true} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {65888#true} assume !(0 != ~p6~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p10~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p1~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p2~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p3~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p4~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {65893#(= main_~p6~0 0)} assume !(0 != ~p5~0); {65893#(= main_~p6~0 0)} is VALID [2022-04-15 11:17:35,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {65893#(= main_~p6~0 0)} assume 0 != ~p6~0; {65889#false} is VALID [2022-04-15 11:17:35,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#false} assume 1 != ~lk6~0; {65889#false} is VALID [2022-04-15 11:17:35,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#false} assume !false; {65889#false} is VALID [2022-04-15 11:17:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714159622] [2022-04-15 11:17:35,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714159622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:35,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:35,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:35,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528793071] [2022-04-15 11:17:35,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528793071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:35,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:35,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572332287] [2022-04-15 11:17:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:35,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:35,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:35,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:35,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:35,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:35,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:35,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:35,840 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:36,997 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-15 11:17:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 11:17:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-15 11:17:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-15 11:17:37,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-15 11:17:37,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:37,418 INFO L225 Difference]: With dead ends: 4557 [2022-04-15 11:17:37,418 INFO L226 Difference]: Without dead ends: 2667 [2022-04-15 11:17:37,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:37,420 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:37,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-15 11:17:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-15 11:17:37,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:37,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:37,616 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:37,618 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:37,794 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-15 11:17:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-15 11:17:37,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:37,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:37,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-15 11:17:37,802 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-15 11:17:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:37,974 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-15 11:17:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-15 11:17:37,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:37,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:37,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:37,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-15 11:17:38,277 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-15 11:17:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:38,277 INFO L478 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-15 11:17:38,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:38,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2665 states and 4359 transitions. [2022-04-15 11:17:42,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-15 11:17:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:17:42,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:42,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:42,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:17:42,411 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-15 11:17:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061415712] [2022-04-15 11:17:42,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 2 times [2022-04-15 11:17:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:42,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717121894] [2022-04-15 11:17:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:42,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-15 11:17:42,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {85678#true} call ULTIMATE.init(); {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:42,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {85684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {85678#true} assume true; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85678#true} {85678#true} #268#return; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {85678#true} call #t~ret19 := main(); {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {85678#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {85678#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {85678#true} is VALID [2022-04-15 11:17:42,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {85678#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {85678#true} is VALID [2022-04-15 11:17:42,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {85678#true} assume !(0 != ~p1~0); {85678#true} is VALID [2022-04-15 11:17:42,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {85678#true} assume !(0 != ~p2~0); {85678#true} is VALID [2022-04-15 11:17:42,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {85678#true} assume !(0 != ~p3~0); {85678#true} is VALID [2022-04-15 11:17:42,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {85678#true} assume !(0 != ~p4~0); {85678#true} is VALID [2022-04-15 11:17:42,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {85678#true} assume !(0 != ~p5~0); {85678#true} is VALID [2022-04-15 11:17:42,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {85678#true} assume 0 != ~p6~0;~lk6~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {85683#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {85683#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {85683#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {85679#false} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {85679#false} assume 0 != ~p7~0; {85679#false} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {85679#false} assume 1 != ~lk7~0; {85679#false} is VALID [2022-04-15 11:17:42,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {85679#false} assume !false; {85679#false} is VALID [2022-04-15 11:17:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:42,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717121894] [2022-04-15 11:17:42,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717121894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:42,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:42,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:42,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:42,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061415712] [2022-04-15 11:17:42,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061415712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:42,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:42,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795998116] [2022-04-15 11:17:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:17:42,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:42,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:42,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:42,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:42,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:42,486 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:43,540 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-15 11:17:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:17:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 11:17:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-15 11:17:43,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-15 11:17:43,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:43,965 INFO L225 Difference]: With dead ends: 3997 [2022-04-15 11:17:43,965 INFO L226 Difference]: Without dead ends: 2699 [2022-04-15 11:17:43,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:43,968 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:43,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-15 11:17:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-15 11:17:44,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:44,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,158 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,159 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:44,334 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-15 11:17:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-15 11:17:44,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:44,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:44,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 11:17:44,341 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2699 states. [2022-04-15 11:17:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:44,523 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-15 11:17:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-15 11:17:44,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:44,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:44,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:44,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-15 11:17:44,871 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-15 11:17:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:44,872 INFO L478 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-15 11:17:44,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:44,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2697 states and 4359 transitions. [2022-04-15 11:17:48,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4359 edges. 4359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-15 11:17:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:17:48,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:48,919 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:48,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:17:48,919 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-15 11:17:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:48,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453717313] [2022-04-15 11:17:48,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:48,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 2 times [2022-04-15 11:17:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:48,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655198896] [2022-04-15 11:17:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:48,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-15 11:17:48,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-15 11:17:48,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-15 11:17:48,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {104476#true} call ULTIMATE.init(); {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:48,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {104482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {104476#true} assume true; {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104476#true} {104476#true} #268#return; {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {104476#true} call #t~ret19 := main(); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {104476#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {104476#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {104476#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {104476#true} assume !(0 != ~p1~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {104476#true} assume !(0 != ~p2~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {104476#true} assume !(0 != ~p3~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {104476#true} assume !(0 != ~p4~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {104476#true} assume !(0 != ~p5~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {104476#true} assume !(0 != ~p6~0); {104476#true} is VALID [2022-04-15 11:17:48,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {104476#true} assume 0 != ~p7~0;~lk7~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {104481#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {104481#(= main_~lk7~0 1)} assume 0 != ~p7~0; {104481#(= main_~lk7~0 1)} is VALID [2022-04-15 11:17:48,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {104481#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {104477#false} is VALID [2022-04-15 11:17:48,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {104477#false} assume !false; {104477#false} is VALID [2022-04-15 11:17:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:48,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655198896] [2022-04-15 11:17:48,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655198896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:48,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:48,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:48,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:48,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453717313] [2022-04-15 11:17:48,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453717313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:48,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:48,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805887847] [2022-04-15 11:17:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:17:48,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:48,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:48,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:48,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:48,976 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:50,397 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-15 11:17:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:17:50,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:17:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 11:17:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-15 11:17:50,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-15 11:17:50,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:51,463 INFO L225 Difference]: With dead ends: 4877 [2022-04-15 11:17:51,463 INFO L226 Difference]: Without dead ends: 4875 [2022-04-15 11:17:51,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:17:51,464 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:51,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:17:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-15 11:17:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-15 11:17:51,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:51,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:51,724 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:51,727 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:52,337 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-15 11:17:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-15 11:17:52,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:52,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:52,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-15 11:17:52,347 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-15 11:17:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:52,962 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-15 11:17:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-15 11:17:52,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:52,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:52,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:52,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-15 11:17:53,627 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-15 11:17:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:53,627 INFO L478 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-15 11:17:53,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:53,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3849 states and 6055 transitions. [2022-04-15 11:17:59,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6055 edges. 6055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-15 11:17:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:17:59,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:59,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:59,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:17:59,257 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-15 11:17:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1981690105] [2022-04-15 11:17:59,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 2 times [2022-04-15 11:17:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:59,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899985103] [2022-04-15 11:17:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:59,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-15 11:17:59,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-15 11:17:59,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {131690#true} call ULTIMATE.init(); {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {131696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {131690#true} assume true; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131690#true} {131690#true} #268#return; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {131690#true} call #t~ret19 := main(); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {131690#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {131690#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {131690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {131690#true} assume !(0 != ~p1~0); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {131690#true} assume !(0 != ~p2~0); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {131690#true} assume !(0 != ~p3~0); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {131690#true} assume !(0 != ~p4~0); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {131690#true} assume !(0 != ~p5~0); {131690#true} is VALID [2022-04-15 11:17:59,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {131690#true} assume !(0 != ~p6~0); {131690#true} is VALID [2022-04-15 11:17:59,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {131690#true} assume !(0 != ~p7~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p10~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p1~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p2~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p3~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p4~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p5~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {131695#(= main_~p7~0 0)} assume !(0 != ~p6~0); {131695#(= main_~p7~0 0)} is VALID [2022-04-15 11:17:59,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {131695#(= main_~p7~0 0)} assume 0 != ~p7~0; {131691#false} is VALID [2022-04-15 11:17:59,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {131691#false} assume 1 != ~lk7~0; {131691#false} is VALID [2022-04-15 11:17:59,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {131691#false} assume !false; {131691#false} is VALID [2022-04-15 11:17:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:17:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:59,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899985103] [2022-04-15 11:17:59,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899985103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:59,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:59,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:59,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1981690105] [2022-04-15 11:17:59,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1981690105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:59,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:59,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:17:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801886624] [2022-04-15 11:17:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:17:59,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:59,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:17:59,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:59,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:17:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:17:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:17:59,337 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:03,199 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-15 11:18:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 11:18:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 11:18:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-15 11:18:03,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-15 11:18:03,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:04,458 INFO L225 Difference]: With dead ends: 9037 [2022-04-15 11:18:04,459 INFO L226 Difference]: Without dead ends: 5259 [2022-04-15 11:18:04,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:04,463 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:04,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-15 11:18:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-15 11:18:04,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:04,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:04,852 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:05,540 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-15 11:18:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-15 11:18:05,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:05,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:05,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 11:18:05,553 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5259 states. [2022-04-15 11:18:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:06,237 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-15 11:18:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-15 11:18:06,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:06,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:06,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:06,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-15 11:18:07,425 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-15 11:18:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:07,425 INFO L478 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-15 11:18:07,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:07,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5257 states and 8263 transitions. [2022-04-15 11:18:15,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-15 11:18:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:18:15,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:15,492 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:15,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:18:15,493 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-15 11:18:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:15,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1027852593] [2022-04-15 11:18:15,493 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 2 times [2022-04-15 11:18:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:15,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192041392] [2022-04-15 11:18:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:15,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-15 11:18:15,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {170808#true} call ULTIMATE.init(); {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {170814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {170808#true} assume true; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170808#true} {170808#true} #268#return; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {170808#true} call #t~ret19 := main(); {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {170808#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {170808#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {170808#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {170808#true} assume !(0 != ~p1~0); {170808#true} is VALID [2022-04-15 11:18:15,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {170808#true} assume !(0 != ~p2~0); {170808#true} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {170808#true} assume !(0 != ~p3~0); {170808#true} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {170808#true} assume !(0 != ~p4~0); {170808#true} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {170808#true} assume !(0 != ~p5~0); {170808#true} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {170808#true} assume !(0 != ~p6~0); {170808#true} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {170808#true} assume 0 != ~p7~0;~lk7~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {170813#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {170813#(not (= main_~p7~0 0))} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {170813#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {170809#false} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {170809#false} assume 0 != ~p8~0; {170809#false} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {170809#false} assume 1 != ~lk8~0; {170809#false} is VALID [2022-04-15 11:18:15,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {170809#false} assume !false; {170809#false} is VALID [2022-04-15 11:18:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192041392] [2022-04-15 11:18:15,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192041392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:15,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:15,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:15,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:15,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1027852593] [2022-04-15 11:18:15,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1027852593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:15,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:15,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363110081] [2022-04-15 11:18:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:18:15,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:15,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:15,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:15,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:15,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:15,543 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:18,723 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-15 11:18:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:18:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 11:18:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-15 11:18:18,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-15 11:18:18,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:20,001 INFO L225 Difference]: With dead ends: 7885 [2022-04-15 11:18:20,001 INFO L226 Difference]: Without dead ends: 5323 [2022-04-15 11:18:20,004 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:20,004 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:20,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-15 11:18:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-15 11:18:20,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:20,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,390 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:20,394 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:21,088 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-15 11:18:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-15 11:18:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:21,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-15 11:18:21,100 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-15 11:18:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:21,813 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-15 11:18:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-15 11:18:21,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:21,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:21,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:21,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-15 11:18:22,978 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-15 11:18:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:22,978 INFO L478 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-15 11:18:22,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:22,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5321 states and 8263 transitions. [2022-04-15 11:18:31,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8263 edges. 8263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-15 11:18:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:18:31,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:31,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:31,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:18:31,110 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-15 11:18:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:31,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974887656] [2022-04-15 11:18:31,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 2 times [2022-04-15 11:18:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:31,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755215242] [2022-04-15 11:18:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:31,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:31,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-15 11:18:31,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-15 11:18:31,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-15 11:18:31,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {207878#true} call ULTIMATE.init(); {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {207884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {207878#true} assume true; {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207878#true} {207878#true} #268#return; {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {207878#true} call #t~ret19 := main(); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {207878#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {207878#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {207878#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {207878#true} assume !(0 != ~p1~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {207878#true} assume !(0 != ~p2~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {207878#true} assume !(0 != ~p3~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {207878#true} assume !(0 != ~p4~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {207878#true} assume !(0 != ~p5~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {207878#true} assume !(0 != ~p6~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {207878#true} assume !(0 != ~p7~0); {207878#true} is VALID [2022-04-15 11:18:31,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {207878#true} assume 0 != ~p8~0;~lk8~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {207883#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {207883#(= main_~lk8~0 1)} assume 0 != ~p8~0; {207883#(= main_~lk8~0 1)} is VALID [2022-04-15 11:18:31,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {207883#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {207879#false} is VALID [2022-04-15 11:18:31,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {207879#false} assume !false; {207879#false} is VALID [2022-04-15 11:18:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:31,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755215242] [2022-04-15 11:18:31,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755215242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:31,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:31,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:31,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974887656] [2022-04-15 11:18:31,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974887656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:31,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:31,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460888113] [2022-04-15 11:18:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:18:31,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:31,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:31,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:31,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:31,171 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:35,685 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-15 11:18:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:35,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:18:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:18:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-15 11:18:35,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-15 11:18:35,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:39,511 INFO L225 Difference]: With dead ends: 9485 [2022-04-15 11:18:39,511 INFO L226 Difference]: Without dead ends: 9483 [2022-04-15 11:18:39,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:18:39,520 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:39,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-15 11:18:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-15 11:18:40,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:40,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:40,095 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:40,100 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,503 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-15 11:18:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-15 11:18:42,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:42,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:42,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-15 11:18:42,523 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-15 11:18:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:44,864 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-15 11:18:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-15 11:18:44,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:44,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:44,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:44,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-15 11:18:47,465 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-15 11:18:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:47,465 INFO L478 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-15 11:18:47,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:47,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7689 states and 11591 transitions. [2022-04-15 11:18:58,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11591 edges. 11591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-15 11:18:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:18:58,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:58,827 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:58,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:18:58,827 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-15 11:18:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050714018] [2022-04-15 11:18:58,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 2 times [2022-04-15 11:18:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006921158] [2022-04-15 11:18:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:58,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-15 11:18:58,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {261204#true} call ULTIMATE.init(); {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {261210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {261204#true} assume true; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261204#true} {261204#true} #268#return; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {261204#true} call #t~ret19 := main(); {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {261204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {261204#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {261204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {261204#true} assume !(0 != ~p1~0); {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {261204#true} assume !(0 != ~p2~0); {261204#true} is VALID [2022-04-15 11:18:58,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {261204#true} assume !(0 != ~p3~0); {261204#true} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {261204#true} assume !(0 != ~p4~0); {261204#true} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {261204#true} assume !(0 != ~p5~0); {261204#true} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {261204#true} assume !(0 != ~p6~0); {261204#true} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {261204#true} assume !(0 != ~p7~0); {261204#true} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {261204#true} assume !(0 != ~p8~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p10~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p1~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p2~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p3~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p4~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p5~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p6~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {261209#(= main_~p8~0 0)} assume !(0 != ~p7~0); {261209#(= main_~p8~0 0)} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {261209#(= main_~p8~0 0)} assume 0 != ~p8~0; {261205#false} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {261205#false} assume 1 != ~lk8~0; {261205#false} is VALID [2022-04-15 11:18:58,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {261205#false} assume !false; {261205#false} is VALID [2022-04-15 11:18:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:58,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006921158] [2022-04-15 11:18:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006921158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:58,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050714018] [2022-04-15 11:18:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050714018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:58,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75591391] [2022-04-15 11:18:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:58,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:18:58,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:58,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:18:58,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:58,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:58,897 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:13,554 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-15 11:19:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:19:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-15 11:19:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-15 11:19:13,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-15 11:19:13,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:18,059 INFO L225 Difference]: With dead ends: 17933 [2022-04-15 11:19:18,059 INFO L226 Difference]: Without dead ends: 10379 [2022-04-15 11:19:18,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:18,067 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:18,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-15 11:19:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-15 11:19:18,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:18,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:18,881 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:18,895 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:21,422 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-15 11:19:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-15 11:19:21,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:21,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:21,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-15 11:19:21,450 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-15 11:19:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:24,354 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-15 11:19:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-15 11:19:24,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:24,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:24,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:24,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-15 11:19:28,846 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-15 11:19:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:28,846 INFO L478 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-15 11:19:28,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:28,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10377 states and 15623 transitions. [2022-04-15 11:19:45,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-15 11:19:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:19:45,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:45,028 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:45,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:19:45,028 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-15 11:19:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243819476] [2022-04-15 11:19:45,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 2 times [2022-04-15 11:19:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:45,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384308567] [2022-04-15 11:19:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:45,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-15 11:19:45,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-15 11:19:45,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {338594#true} call ULTIMATE.init(); {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {338600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {338594#true} assume true; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338594#true} {338594#true} #268#return; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {338594#true} call #t~ret19 := main(); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {338594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {338594#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {338594#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {338594#true} assume !(0 != ~p1~0); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {338594#true} assume !(0 != ~p2~0); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {338594#true} assume !(0 != ~p3~0); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {338594#true} assume !(0 != ~p4~0); {338594#true} is VALID [2022-04-15 11:19:45,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {338594#true} assume !(0 != ~p5~0); {338594#true} is VALID [2022-04-15 11:19:45,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {338594#true} assume !(0 != ~p6~0); {338594#true} is VALID [2022-04-15 11:19:45,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {338594#true} assume !(0 != ~p7~0); {338594#true} is VALID [2022-04-15 11:19:45,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {338594#true} assume 0 != ~p8~0;~lk8~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {338599#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {338599#(not (= main_~p8~0 0))} is VALID [2022-04-15 11:19:45,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {338599#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {338595#false} is VALID [2022-04-15 11:19:45,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {338595#false} assume 0 != ~p9~0; {338595#false} is VALID [2022-04-15 11:19:45,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {338595#false} assume 1 != ~lk9~0; {338595#false} is VALID [2022-04-15 11:19:45,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {338595#false} assume !false; {338595#false} is VALID [2022-04-15 11:19:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:45,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384308567] [2022-04-15 11:19:45,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384308567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:45,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:45,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:45,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:45,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243819476] [2022-04-15 11:19:45,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243819476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:45,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:45,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174433203] [2022-04-15 11:19:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:45,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:45,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:45,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:45,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:45,095 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:56,603 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-15 11:19:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:19:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-15 11:19:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-15 11:19:56,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-15 11:19:56,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:01,257 INFO L225 Difference]: With dead ends: 15565 [2022-04-15 11:20:01,258 INFO L226 Difference]: Without dead ends: 10507 [2022-04-15 11:20:01,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:20:01,264 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:01,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:20:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-15 11:20:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-15 11:20:02,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:20:02,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:02,087 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:02,101 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:04,732 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-15 11:20:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-15 11:20:04,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:04,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:04,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-15 11:20:04,755 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-15 11:20:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:07,675 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-15 11:20:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-15 11:20:07,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:20:07,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:20:07,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:20:07,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:20:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-15 11:20:12,250 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-15 11:20:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:20:12,251 INFO L478 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-15 11:20:12,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:12,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10505 states and 15623 transitions. [2022-04-15 11:20:28,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15623 edges. 15623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-15 11:20:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:20:28,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:20:28,467 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:20:28,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:20:28,468 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:20:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:20:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-15 11:20:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590419887] [2022-04-15 11:20:28,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:20:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 2 times [2022-04-15 11:20:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:20:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097692968] [2022-04-15 11:20:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:20:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:20:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:20:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:20:28,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {411760#true} call ULTIMATE.init(); {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:20:28,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {411766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {411760#true} assume true; {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411760#true} {411760#true} #268#return; {411760#true} is VALID [2022-04-15 11:20:28,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {411760#true} call #t~ret19 := main(); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {411760#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {411760#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {411760#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {411760#true} assume !(0 != ~p1~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {411760#true} assume !(0 != ~p2~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {411760#true} assume !(0 != ~p3~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {411760#true} assume !(0 != ~p4~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {411760#true} assume !(0 != ~p5~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {411760#true} assume !(0 != ~p6~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {411760#true} assume !(0 != ~p7~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {411760#true} assume !(0 != ~p8~0); {411760#true} is VALID [2022-04-15 11:20:28,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {411760#true} assume 0 != ~p9~0;~lk9~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {411765#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {411765#(= main_~lk9~0 1)} assume 0 != ~p9~0; {411765#(= main_~lk9~0 1)} is VALID [2022-04-15 11:20:28,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {411765#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {411761#false} is VALID [2022-04-15 11:20:28,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {411761#false} assume !false; {411761#false} is VALID [2022-04-15 11:20:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:20:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:20:28,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097692968] [2022-04-15 11:20:28,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097692968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:28,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:28,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:28,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:20:28,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590419887] [2022-04-15 11:20:28,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590419887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:20:28,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:20:28,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:20:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390517630] [2022-04-15 11:20:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:20:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:20:28,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:20:28,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:28,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:28,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:20:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:20:28,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:20:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:20:28,523 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:20:45,007 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-15 11:20:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:20:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:20:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:20:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:20:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:20:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 11:20:45,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 11:20:45,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:20:59,631 INFO L225 Difference]: With dead ends: 18445 [2022-04-15 11:20:59,631 INFO L226 Difference]: Without dead ends: 18443 [2022-04-15 11:20:59,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-15 11:20:59,635 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:20:59,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:20:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-15 11:21:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-15 11:21:00,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:21:00,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:00,869 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:00,885 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:09,690 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-15 11:21:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-15 11:21:09,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:09,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:09,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-15 11:21:09,735 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-15 11:21:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:21:18,401 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-15 11:21:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-15 11:21:18,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:21:18,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:21:18,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:21:18,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:21:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-15 11:21:28,922 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-15 11:21:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:21:28,922 INFO L478 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-15 11:21:28,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:28,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15369 states and 22151 transitions. [2022-04-15 11:21:51,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22151 edges. 22151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-15 11:21:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:21:51,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:21:51,705 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:21:51,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:21:51,705 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:21:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:21:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-15 11:21:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:51,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [120303019] [2022-04-15 11:21:51,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:21:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 2 times [2022-04-15 11:21:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:21:51,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527223280] [2022-04-15 11:21:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:21:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:21:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:21:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:21:51,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-15 11:21:51,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-15 11:21:51,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {516286#true} call ULTIMATE.init(); {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {516292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {516286#true} assume true; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516286#true} {516286#true} #268#return; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {516286#true} call #t~ret19 := main(); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {516286#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {516286#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {516286#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {516286#true} assume !(0 != ~p1~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {516286#true} assume !(0 != ~p2~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {516286#true} assume !(0 != ~p3~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {516286#true} assume !(0 != ~p4~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {516286#true} assume !(0 != ~p5~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {516286#true} assume !(0 != ~p6~0); {516286#true} is VALID [2022-04-15 11:21:51,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {516286#true} assume !(0 != ~p7~0); {516286#true} is VALID [2022-04-15 11:21:51,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {516286#true} assume !(0 != ~p8~0); {516286#true} is VALID [2022-04-15 11:21:51,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {516286#true} assume !(0 != ~p9~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p10~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p1~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p2~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p3~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p4~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p5~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p6~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p7~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {516291#(= main_~p9~0 0)} assume !(0 != ~p8~0); {516291#(= main_~p9~0 0)} is VALID [2022-04-15 11:21:51,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {516291#(= main_~p9~0 0)} assume 0 != ~p9~0; {516287#false} is VALID [2022-04-15 11:21:51,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {516287#false} assume 1 != ~lk9~0; {516287#false} is VALID [2022-04-15 11:21:51,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {516287#false} assume !false; {516287#false} is VALID [2022-04-15 11:21:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:21:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:21:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527223280] [2022-04-15 11:21:51,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527223280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:51,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:51,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:51,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:21:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [120303019] [2022-04-15 11:21:51,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [120303019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:21:51,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:21:51,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:21:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065378483] [2022-04-15 11:21:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:21:51,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:21:51,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:21:51,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:21:51,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:21:51,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:21:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:21:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:21:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:21:51,763 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:00,887 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-15 11:23:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:23:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:23:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:23:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 11:23:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-15 11:23:00,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-15 11:23:01,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:18,219 INFO L225 Difference]: With dead ends: 35597 [2022-04-15 11:23:18,220 INFO L226 Difference]: Without dead ends: 20491 [2022-04-15 11:23:18,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:23:18,237 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:23:18,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:23:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-15 11:23:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-15 11:23:19,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:23:19,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:19,969 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:19,997 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:29,591 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-15 11:23:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-15 11:23:29,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:29,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:29,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-15 11:23:29,651 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-15 11:23:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:40,860 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-15 11:23:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-15 11:23:40,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:40,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:40,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:23:40,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:23:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-15 11:23:58,308 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-15 11:23:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:23:58,308 INFO L478 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-15 11:23:58,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:23:58,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20489 states and 29447 transitions. [2022-04-15 11:24:29,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-15 11:24:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:24:30,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:24:30,005 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:24:30,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:24:30,005 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:24:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:24:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-15 11:24:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:30,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558115432] [2022-04-15 11:24:30,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:24:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 2 times [2022-04-15 11:24:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:24:30,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043131312] [2022-04-15 11:24:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:24:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:24:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:24:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:30,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {669452#true} call ULTIMATE.init(); {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:24:30,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {669458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {669452#true} assume true; {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669452#true} {669452#true} #268#return; {669452#true} is VALID [2022-04-15 11:24:30,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {669452#true} call #t~ret19 := main(); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {669452#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {669452#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {669452#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {669452#true} assume !(0 != ~p1~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {669452#true} assume !(0 != ~p2~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {669452#true} assume !(0 != ~p3~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {669452#true} assume !(0 != ~p4~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {669452#true} assume !(0 != ~p5~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {669452#true} assume !(0 != ~p6~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {669452#true} assume !(0 != ~p7~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {669452#true} assume !(0 != ~p8~0); {669452#true} is VALID [2022-04-15 11:24:30,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {669452#true} assume 0 != ~p9~0;~lk9~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {669457#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {669457#(not (= main_~p9~0 0))} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {669457#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {669453#false} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {669453#false} assume 0 != ~p10~0; {669453#false} is VALID [2022-04-15 11:24:30,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {669453#false} assume 1 != ~lk10~0; {669453#false} is VALID [2022-04-15 11:24:30,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {669453#false} assume !false; {669453#false} is VALID [2022-04-15 11:24:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:24:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:24:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043131312] [2022-04-15 11:24:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043131312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:30,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:30,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:24:30,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:24:30,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558115432] [2022-04-15 11:24:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558115432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:30,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:30,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:24:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018233877] [2022-04-15 11:24:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:24:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 11:24:30,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:24:30,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:24:30,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:30,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:24:30,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:24:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:24:30,056 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:20,936 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-15 11:25:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:25:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 11:25:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:25:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 11:25:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-15 11:25:20,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-15 11:25:21,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:25:39,399 INFO L225 Difference]: With dead ends: 30733 [2022-04-15 11:25:39,400 INFO L226 Difference]: Without dead ends: 20747 [2022-04-15 11:25:39,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:25:39,414 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:25:39,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:25:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-15 11:25:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-15 11:25:41,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:25:41,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:41,222 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:41,250 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:25:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:25:52,102 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-15 11:25:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-15 11:25:52,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:25:52,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:25:52,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-15 11:25:52,222 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-15 11:26:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:03,064 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-15 11:26:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-15 11:26:03,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:03,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:03,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:26:03,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:26:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-15 11:26:21,762 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-15 11:26:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:26:21,763 INFO L478 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-15 11:26:21,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:21,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20745 states and 29447 transitions. [2022-04-15 11:26:53,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29447 edges. 29447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-15 11:26:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:26:53,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:26:53,558 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:26:53,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:26:53,559 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:26:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:26:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-15 11:26:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:53,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1657819558] [2022-04-15 11:26:53,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:26:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 2 times [2022-04-15 11:26:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:26:53,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235760601] [2022-04-15 11:26:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:26:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:26:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:26:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:53,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-15 11:26:53,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-15 11:26:53,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-15 11:26:53,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {813914#true} call ULTIMATE.init(); {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:26:53,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {813920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {813914#true} is VALID [2022-04-15 11:26:53,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {813914#true} assume true; {813914#true} is VALID [2022-04-15 11:26:53,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813914#true} {813914#true} #268#return; {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {813914#true} call #t~ret19 := main(); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {813914#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {813914#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {813914#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {813914#true} assume !(0 != ~p1~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {813914#true} assume !(0 != ~p2~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {813914#true} assume !(0 != ~p3~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {813914#true} assume !(0 != ~p4~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {813914#true} assume !(0 != ~p5~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {813914#true} assume !(0 != ~p6~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {813914#true} assume !(0 != ~p7~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {813914#true} assume !(0 != ~p8~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {813914#true} assume !(0 != ~p9~0); {813914#true} is VALID [2022-04-15 11:26:53,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {813914#true} assume !(0 != ~p10~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p1~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p2~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p3~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p4~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p5~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p6~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p7~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p8~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {813919#(= main_~p10~0 0)} assume !(0 != ~p9~0); {813919#(= main_~p10~0 0)} is VALID [2022-04-15 11:26:53,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {813919#(= main_~p10~0 0)} assume 0 != ~p10~0; {813915#false} is VALID [2022-04-15 11:26:53,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {813915#false} assume 1 != ~lk10~0; {813915#false} is VALID [2022-04-15 11:26:53,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {813915#false} assume !false; {813915#false} is VALID [2022-04-15 11:26:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:26:53,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:26:53,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235760601] [2022-04-15 11:26:53,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235760601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:53,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:53,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:26:53,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:26:53,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1657819558] [2022-04-15 11:26:53,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1657819558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:53,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:53,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:26:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940321787] [2022-04-15 11:26:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:26:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 11:26:53,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:26:53,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:26:53,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:53,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:26:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:53,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:26:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:26:53,618 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)