/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:55:00,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:55:00,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:55:00,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:55:00,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:55:00,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:55:00,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:55:00,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:55:00,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:55:00,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:55:00,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:55:01,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:55:01,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:55:01,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:55:01,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:55:01,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:55:01,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:55:01,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:55:01,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:55:01,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:55:01,008 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:55:01,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:55:01,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:55:01,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:55:01,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:55:01,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:55:01,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:55:01,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:55:01,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:55:01,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:55:01,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:55:01,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:55:01,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:55:01,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:55:01,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:55:01,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:55:01,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:55:01,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:55:01,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:55:01,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:55:01,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:55:01,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:55:01,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:55:01,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:55:01,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:55:01,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:55:01,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:55:01,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:55:01,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:55:01,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:55:01,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:55:01,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:55:01,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:55:01,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:55:01,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:55:01,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:55:01,032 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:55:01,033 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:55:01,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:55:01,033 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:55:01,033 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 17:55:01,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:55:01,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:55:01,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:55:01,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:55:01,277 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:55:01,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-15 17:55:01,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78d6104/b43db00976d54af0b7fe8f35633607b3/FLAG7885f2500 [2022-04-15 17:55:01,746 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:55:01,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-15 17:55:01,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78d6104/b43db00976d54af0b7fe8f35633607b3/FLAG7885f2500 [2022-04-15 17:55:02,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d78d6104/b43db00976d54af0b7fe8f35633607b3 [2022-04-15 17:55:02,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:55:02,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:55:02,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:55:02,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:55:02,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:55:02,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6f5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02, skipping insertion in model container [2022-04-15 17:55:02,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:55:02,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:55:02,376 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_12.c[4591,4604] [2022-04-15 17:55:02,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:55:02,385 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:55:02,430 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_12.c[4591,4604] [2022-04-15 17:55:02,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:55:02,453 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:55:02,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02 WrapperNode [2022-04-15 17:55:02,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:55:02,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:55:02,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:55:02,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:55:02,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:55:02,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:55:02,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:55:02,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:55:02,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (1/1) ... [2022-04-15 17:55:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:55:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:55:02,540 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 17:55:02,565 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 17:55:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:55:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:55:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:55:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:55:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:55:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:55:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:55:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:55:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:55:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:55:02,661 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:55:02,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:55:02,908 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:55:02,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:55:02,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:55:02,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:55:02 BoogieIcfgContainer [2022-04-15 17:55:02,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:55:02,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:55:02,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:55:02,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:55:02,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:55:02" (1/3) ... [2022-04-15 17:55:02,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed3c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:55:02, skipping insertion in model container [2022-04-15 17:55:02,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:02" (2/3) ... [2022-04-15 17:55:02,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed3c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:55:02, skipping insertion in model container [2022-04-15 17:55:02,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:55:02" (3/3) ... [2022-04-15 17:55:02,929 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-04-15 17:55:02,933 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:55:02,934 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:55:02,983 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:55:02,991 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 17:55:02,991 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:55:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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 17:55:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 17:55:03,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:03,026 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:03,027 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times [2022-04-15 17:55:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:03,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760322874] [2022-04-15 17:55:03,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 2 times [2022-04-15 17:55:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:03,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273058829] [2022-04-15 17:55:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:03,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(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(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 17:55:03,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 17:55:03,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-15 17:55:03,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:03,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(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(16, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 17:55:03,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 17:55:03,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-15 17:55:03,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID [2022-04-15 17:55:03,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#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;havoc ~cond~0; {54#true} is VALID [2022-04-15 17:55:03,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {54#true} is VALID [2022-04-15 17:55:03,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#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; {54#true} is VALID [2022-04-15 17:55:03,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} assume 0 != ~p1~0;~lk1~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p1~0; {59#(= main_~lk1~0 1)} is VALID [2022-04-15 17:55:03,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID [2022-04-15 17:55:03,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-15 17:55:03,302 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 17:55:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:03,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273058829] [2022-04-15 17:55:03,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273058829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:03,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:03,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:03,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:03,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760322874] [2022-04-15 17:55:03,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760322874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:03,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:03,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964928685] [2022-04-15 17:55:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:55:03,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:03,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:03,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:03,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:03,371 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:03,845 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-15 17:55:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:03,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:55:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 17:55:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-15 17:55:03,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-15 17:55:04,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:04,060 INFO L225 Difference]: With dead ends: 100 [2022-04-15 17:55:04,061 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 17:55:04,063 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 17:55:04,067 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:04,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 17:55:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-15 17:55:04,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:04,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,106 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,107 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:04,113 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-15 17:55:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-15 17:55:04,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:04,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:04,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 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 85 states. [2022-04-15 17:55:04,115 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 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 85 states. [2022-04-15 17:55:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:04,120 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-15 17:55:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-15 17:55:04,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:04,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:04,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:04,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-15 17:55:04,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-15 17:55:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:04,127 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-15 17:55:04,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions. [2022-04-15 17:55:04,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-15 17:55:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 17:55:04,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:04,231 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:04,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:55:04,232 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times [2022-04-15 17:55:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:04,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436070881] [2022-04-15 17:55:04,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 2 times [2022-04-15 17:55:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:04,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109681639] [2022-04-15 17:55:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:04,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#(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(16, 2);call #Ultimate.allocInit(12, 3); {554#true} is VALID [2022-04-15 17:55:04,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 17:55:04,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-15 17:55:04,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:04,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(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(16, 2);call #Ultimate.allocInit(12, 3); {554#true} is VALID [2022-04-15 17:55:04,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 17:55:04,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-15 17:55:04,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret17 := main(); {554#true} is VALID [2022-04-15 17:55:04,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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;havoc ~cond~0; {554#true} is VALID [2022-04-15 17:55:04,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {554#true} is VALID [2022-04-15 17:55:04,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#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; {554#true} is VALID [2022-04-15 17:55:04,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 != ~p1~0); {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p2~0); {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p10~0); {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-15 17:55:04,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p1~0; {555#false} is VALID [2022-04-15 17:55:04,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#false} assume 1 != ~lk1~0; {555#false} is VALID [2022-04-15 17:55:04,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-15 17:55:04,333 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 17:55:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:04,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109681639] [2022-04-15 17:55:04,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109681639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:04,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:04,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:04,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436070881] [2022-04-15 17:55:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436070881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829159083] [2022-04-15 17:55:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:55:04,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:04,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:04,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:04,359 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:04,625 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-15 17:55:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 17:55:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 17:55:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-15 17:55:04,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-15 17:55:04,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:04,820 INFO L225 Difference]: With dead ends: 138 [2022-04-15 17:55:04,820 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 17:55:04,821 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 17:55:04,825 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:04,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 17:55:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-15 17:55:04,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:04,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,849 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:04,853 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-15 17:55:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-15 17:55:04,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:04,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:04,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 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 85 states. [2022-04-15 17:55:04,854 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 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 85 states. [2022-04-15 17:55:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:04,858 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-15 17:55:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-15 17:55:04,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:04,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:04,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:04,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-15 17:55:04,863 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-15 17:55:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:04,863 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-15 17:55:04,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:04,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 150 transitions. [2022-04-15 17:55:05,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-15 17:55:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:55:05,013 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:05,013 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:05,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:55:05,014 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times [2022-04-15 17:55:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:05,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970725237] [2022-04-15 17:55:05,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 2 times [2022-04-15 17:55:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:05,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322914830] [2022-04-15 17:55:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:05,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(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(16, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-15 17:55:05,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 17:55:05,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-15 17:55:05,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:05,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(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(16, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-15 17:55:05,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 17:55:05,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-15 17:55:05,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2022-04-15 17:55:05,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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;havoc ~cond~0; {1178#true} is VALID [2022-04-15 17:55:05,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1178#true} is VALID [2022-04-15 17:55:05,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#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; {1178#true} is VALID [2022-04-15 17:55:05,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume 0 != ~p1~0;~lk1~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-15 17:55:05,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1179#false} is VALID [2022-04-15 17:55:05,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#false} assume 0 != ~p2~0; {1179#false} is VALID [2022-04-15 17:55:05,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#false} assume 1 != ~lk2~0; {1179#false} is VALID [2022-04-15 17:55:05,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-15 17:55:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:55:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:05,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322914830] [2022-04-15 17:55:05,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322914830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:05,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:05,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:05,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970725237] [2022-04-15 17:55:05,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970725237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:05,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:05,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364576109] [2022-04-15 17:55:05,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:05,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:05,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:05,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:05,155 INFO L87 Difference]: Start difference. First operand 83 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:05,373 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-15 17:55:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 17:55:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-15 17:55:05,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-15 17:55:05,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:05,565 INFO L225 Difference]: With dead ends: 127 [2022-04-15 17:55:05,565 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 17:55:05,566 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 17:55:05,567 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:05,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 17:55:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-15 17:55:05,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:05,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,578 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,579 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:05,582 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-15 17:55:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-15 17:55:05,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:05,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:05,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 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 88 states. [2022-04-15 17:55:05,583 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 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 88 states. [2022-04-15 17:55:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:05,586 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-15 17:55:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-15 17:55:05,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:05,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:05,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:05,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-15 17:55:05,590 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-15 17:55:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:05,591 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-15 17:55:05,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 152 transitions. [2022-04-15 17:55:05,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-15 17:55:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:55:05,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:05,728 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:05,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:55:05,729 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times [2022-04-15 17:55:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:05,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836347207] [2022-04-15 17:55:05,730 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 2 times [2022-04-15 17:55:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:05,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901970270] [2022-04-15 17:55:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:05,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#(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(16, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-04-15 17:55:05,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-15 17:55:05,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-15 17:55:05,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:05,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#(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(16, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-04-15 17:55:05,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-15 17:55:05,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-15 17:55:05,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2022-04-15 17:55:05,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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;havoc ~cond~0; {1792#true} is VALID [2022-04-15 17:55:05,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1792#true} is VALID [2022-04-15 17:55:05,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#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; {1792#true} is VALID [2022-04-15 17:55:05,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 != ~p1~0); {1792#true} is VALID [2022-04-15 17:55:05,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume !(0 != ~p2~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-15 17:55:05,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p2~0; {1793#false} is VALID [2022-04-15 17:55:05,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} assume 1 != ~lk2~0; {1793#false} is VALID [2022-04-15 17:55:05,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-15 17:55:05,798 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 17:55:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:05,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901970270] [2022-04-15 17:55:05,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901970270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:05,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:05,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:05,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836347207] [2022-04-15 17:55:05,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836347207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:05,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:05,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504256665] [2022-04-15 17:55:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:05,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:05,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:05,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:05,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:05,821 INFO L87 Difference]: Start difference. First operand 86 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:06,039 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions. [2022-04-15 17:55:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 17:55:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-15 17:55:06,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-15 17:55:06,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:06,240 INFO L225 Difference]: With dead ends: 238 [2022-04-15 17:55:06,240 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 17:55:06,242 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 17:55:06,243 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:06,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 17:55:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-15 17:55:06,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:06,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,276 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,277 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:06,283 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-15 17:55:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-15 17:55:06,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:06,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:06,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 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 161 states. [2022-04-15 17:55:06,285 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 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 161 states. [2022-04-15 17:55:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:06,291 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-15 17:55:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-15 17:55:06,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:06,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:06,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:06,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2022-04-15 17:55:06,299 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24 [2022-04-15 17:55:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:06,301 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2022-04-15 17:55:06,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 285 transitions. [2022-04-15 17:55:06,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2022-04-15 17:55:06,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 17:55:06,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:06,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:55:06,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:55:06,568 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times [2022-04-15 17:55:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:06,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430201672] [2022-04-15 17:55:06,573 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 2 times [2022-04-15 17:55:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:06,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288096704] [2022-04-15 17:55:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:06,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {2926#(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(16, 2);call #Ultimate.allocInit(12, 3); {2920#true} is VALID [2022-04-15 17:55:06,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-15 17:55:06,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-15 17:55:06,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {2920#true} call ULTIMATE.init(); {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:06,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#(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(16, 2);call #Ultimate.allocInit(12, 3); {2920#true} is VALID [2022-04-15 17:55:06,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-15 17:55:06,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-15 17:55:06,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {2920#true} call #t~ret17 := main(); {2920#true} is VALID [2022-04-15 17:55:06,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#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;havoc ~cond~0; {2920#true} is VALID [2022-04-15 17:55:06,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2920#true} is VALID [2022-04-15 17:55:06,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {2920#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; {2920#true} is VALID [2022-04-15 17:55:06,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} assume !(0 != ~p1~0); {2920#true} is VALID [2022-04-15 17:55:06,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#true} assume 0 != ~p2~0;~lk2~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2925#(= main_~lk2~0 1)} is VALID [2022-04-15 17:55:06,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {2925#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2921#false} is VALID [2022-04-15 17:55:06,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {2921#false} assume !false; {2921#false} is VALID [2022-04-15 17:55:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:55:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:06,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288096704] [2022-04-15 17:55:06,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288096704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:06,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:06,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:06,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430201672] [2022-04-15 17:55:06,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430201672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:06,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:06,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252595926] [2022-04-15 17:55:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:06,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:06,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:06,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:06,688 INFO L87 Difference]: Start difference. First operand 159 states and 285 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:06,899 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions. [2022-04-15 17:55:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 17:55:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 17:55:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-15 17:55:06,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-15 17:55:07,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:07,036 INFO L225 Difference]: With dead ends: 207 [2022-04-15 17:55:07,036 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 17:55:07,037 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 17:55:07,037 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:07,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 17:55:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2022-04-15 17:55:07,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:07,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,053 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,054 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:07,060 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-15 17:55:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-15 17:55:07,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:07,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:07,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-15 17:55:07,062 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-15 17:55:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:07,069 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-15 17:55:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-15 17:55:07,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:07,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:07,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:07,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-15 17:55:07,075 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-15 17:55:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:07,075 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-15 17:55:07,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 283 transitions. [2022-04-15 17:55:07,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-15 17:55:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:55:07,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:07,360 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 17:55:07,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:55:07,360 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times [2022-04-15 17:55:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:07,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266880789] [2022-04-15 17:55:07,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 2 times [2022-04-15 17:55:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:07,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630378420] [2022-04-15 17:55:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:07,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {4080#(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(16, 2);call #Ultimate.allocInit(12, 3); {4074#true} is VALID [2022-04-15 17:55:07,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-15 17:55:07,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-15 17:55:07,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {4074#true} call ULTIMATE.init(); {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:07,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#(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(16, 2);call #Ultimate.allocInit(12, 3); {4074#true} is VALID [2022-04-15 17:55:07,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {4074#true} call #t~ret17 := main(); {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {4074#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;havoc ~cond~0; {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {4074#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {4074#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; {4074#true} is VALID [2022-04-15 17:55:07,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {4074#true} assume !(0 != ~p1~0); {4074#true} is VALID [2022-04-15 17:55:07,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {4074#true} assume !(0 != ~p2~0); {4074#true} is VALID [2022-04-15 17:55:07,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {4074#true} assume 0 != ~p3~0;~lk3~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4079#(= main_~lk3~0 1)} is VALID [2022-04-15 17:55:07,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4075#false} is VALID [2022-04-15 17:55:07,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {4075#false} assume !false; {4075#false} is VALID [2022-04-15 17:55:07,416 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 17:55:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630378420] [2022-04-15 17:55:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630378420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:07,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266880789] [2022-04-15 17:55:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266880789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:07,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:07,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506812459] [2022-04-15 17:55:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:07,418 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 17:55:07,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:07,418 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 17:55:07,435 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 17:55:07,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:07,436 INFO L87 Difference]: Start difference. First operand 159 states and 283 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 17:55:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:07,747 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions. [2022-04-15 17:55:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:07,748 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 17:55:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:07,748 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 17:55:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 17:55:07,750 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 17:55:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-15 17:55:07,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-15 17:55:07,881 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 17:55:07,891 INFO L225 Difference]: With dead ends: 299 [2022-04-15 17:55:07,891 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 17:55:07,891 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 17:55:07,892 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:07,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 17:55:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-15 17:55:07,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:07,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,914 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,915 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:07,923 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-15 17:55:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-15 17:55:07,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:07,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:07,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 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 297 states. [2022-04-15 17:55:07,925 INFO L87 Difference]: Start difference. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 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 297 states. [2022-04-15 17:55:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:07,933 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-15 17:55:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-15 17:55:07,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:07,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:07,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:07,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions. [2022-04-15 17:55:07,941 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25 [2022-04-15 17:55:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:07,941 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions. [2022-04-15 17:55:07,941 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 17:55:07,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 381 transitions. [2022-04-15 17:55:08,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions. [2022-04-15 17:55:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 17:55:08,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:08,343 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 17:55:08,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:55:08,344 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:08,344 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times [2022-04-15 17:55:08,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409775889] [2022-04-15 17:55:08,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 2 times [2022-04-15 17:55:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:08,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197748477] [2022-04-15 17:55:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:08,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {5714#(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(16, 2);call #Ultimate.allocInit(12, 3); {5708#true} is VALID [2022-04-15 17:55:08,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-15 17:55:08,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:08,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {5714#(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(16, 2);call #Ultimate.allocInit(12, 3); {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret17 := main(); {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {5708#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;havoc ~cond~0; {5708#true} is VALID [2022-04-15 17:55:08,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {5708#true} is VALID [2022-04-15 17:55:08,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#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; {5708#true} is VALID [2022-04-15 17:55:08,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !(0 != ~p1~0); {5708#true} is VALID [2022-04-15 17:55:08,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {5708#true} assume !(0 != ~p2~0); {5708#true} is VALID [2022-04-15 17:55:08,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#true} assume !(0 != ~p3~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-15 17:55:08,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p3~0; {5709#false} is VALID [2022-04-15 17:55:08,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#false} assume 1 != ~lk3~0; {5709#false} is VALID [2022-04-15 17:55:08,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2022-04-15 17:55:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:55:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197748477] [2022-04-15 17:55:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197748477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:08,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:08,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:08,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:08,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409775889] [2022-04-15 17:55:08,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409775889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:08,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:08,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583750821] [2022-04-15 17:55:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:08,430 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 17:55:08,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:08,431 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 17:55:08,449 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 17:55:08,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:08,449 INFO L87 Difference]: Start difference. First operand 215 states and 381 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 17:55:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:08,686 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions. [2022-04-15 17:55:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:08,686 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 17:55:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:08,687 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 17:55:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 17:55:08,689 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 17:55:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-15 17:55:08,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-15 17:55:08,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:08,860 INFO L225 Difference]: With dead ends: 511 [2022-04-15 17:55:08,860 INFO L226 Difference]: Without dead ends: 305 [2022-04-15 17:55:08,862 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 17:55:08,862 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:08,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-15 17:55:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2022-04-15 17:55:08,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:08,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:08,889 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:08,889 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:08,896 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-15 17:55:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-15 17:55:08,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:08,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:08,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 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 305 states. [2022-04-15 17:55:08,899 INFO L87 Difference]: Start difference. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 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 305 states. [2022-04-15 17:55:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:08,906 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-15 17:55:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-15 17:55:08,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:08,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:08,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:08,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions. [2022-04-15 17:55:08,916 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25 [2022-04-15 17:55:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:08,916 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions. [2022-04-15 17:55:08,916 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 17:55:08,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 535 transitions. [2022-04-15 17:55:09,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions. [2022-04-15 17:55:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:55:09,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:09,425 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 17:55:09,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:55:09,426 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times [2022-04-15 17:55:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:09,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347650893] [2022-04-15 17:55:09,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 2 times [2022-04-15 17:55:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:09,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456671469] [2022-04-15 17:55:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:09,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:09,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {7964#(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(16, 2);call #Ultimate.allocInit(12, 3); {7958#true} is VALID [2022-04-15 17:55:09,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-15 17:55:09,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-15 17:55:09,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {7958#true} call ULTIMATE.init(); {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:09,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#(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(16, 2);call #Ultimate.allocInit(12, 3); {7958#true} is VALID [2022-04-15 17:55:09,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-15 17:55:09,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-15 17:55:09,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {7958#true} call #t~ret17 := main(); {7958#true} is VALID [2022-04-15 17:55:09,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {7958#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;havoc ~cond~0; {7958#true} is VALID [2022-04-15 17:55:09,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {7958#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {7958#true} is VALID [2022-04-15 17:55:09,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {7958#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; {7958#true} is VALID [2022-04-15 17:55:09,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#true} assume !(0 != ~p1~0); {7958#true} is VALID [2022-04-15 17:55:09,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#true} assume !(0 != ~p2~0); {7958#true} is VALID [2022-04-15 17:55:09,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#true} assume 0 != ~p3~0;~lk3~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-15 17:55:09,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7959#false} is VALID [2022-04-15 17:55:09,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {7959#false} assume 0 != ~p4~0; {7959#false} is VALID [2022-04-15 17:55:09,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {7959#false} assume 1 != ~lk4~0; {7959#false} is VALID [2022-04-15 17:55:09,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {7959#false} assume !false; {7959#false} is VALID [2022-04-15 17:55:09,494 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 17:55:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:09,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456671469] [2022-04-15 17:55:09,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456671469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:09,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:09,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:09,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:09,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347650893] [2022-04-15 17:55:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347650893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:09,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:09,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556465005] [2022-04-15 17:55:09,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:09,496 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 17:55:09,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:09,497 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 17:55:09,515 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 17:55:09,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:09,517 INFO L87 Difference]: Start difference. First operand 303 states and 535 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 17:55:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:09,779 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions. [2022-04-15 17:55:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:09,779 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 17:55:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:09,780 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 17:55:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 17:55:09,782 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 17:55:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-15 17:55:09,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-15 17:55:09,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:09,967 INFO L225 Difference]: With dead ends: 457 [2022-04-15 17:55:09,967 INFO L226 Difference]: Without dead ends: 311 [2022-04-15 17:55:09,968 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 17:55:09,969 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:09,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-15 17:55:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-15 17:55:09,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:09,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:09,994 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:09,995 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:10,003 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-15 17:55:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-15 17:55:10,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:10,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:10,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 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 311 states. [2022-04-15 17:55:10,006 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 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 311 states. [2022-04-15 17:55:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:10,013 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-15 17:55:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-15 17:55:10,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:10,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:10,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:10,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions. [2022-04-15 17:55:10,023 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26 [2022-04-15 17:55:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:10,023 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions. [2022-04-15 17:55:10,023 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 17:55:10,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 539 transitions. [2022-04-15 17:55:10,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions. [2022-04-15 17:55:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:55:10,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:10,576 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 17:55:10,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:55:10,576 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times [2022-04-15 17:55:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:10,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1713448273] [2022-04-15 17:55:10,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 2 times [2022-04-15 17:55:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:10,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515067018] [2022-04-15 17:55:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:10,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {10130#(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(16, 2);call #Ultimate.allocInit(12, 3); {10124#true} is VALID [2022-04-15 17:55:10,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 17:55:10,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:10,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {10130#(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(16, 2);call #Ultimate.allocInit(12, 3); {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret17 := main(); {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;havoc ~cond~0; {10124#true} is VALID [2022-04-15 17:55:10,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {10124#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {10124#true} is VALID [2022-04-15 17:55:10,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#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; {10124#true} is VALID [2022-04-15 17:55:10,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 != ~p1~0); {10124#true} is VALID [2022-04-15 17:55:10,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume !(0 != ~p2~0); {10124#true} is VALID [2022-04-15 17:55:10,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {10124#true} assume !(0 != ~p3~0); {10124#true} is VALID [2022-04-15 17:55:10,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#true} assume 0 != ~p4~0;~lk4~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10129#(= main_~lk4~0 1)} is VALID [2022-04-15 17:55:10,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {10129#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10125#false} is VALID [2022-04-15 17:55:10,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-15 17:55:10,661 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 17:55:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515067018] [2022-04-15 17:55:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515067018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:10,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:10,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:10,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1713448273] [2022-04-15 17:55:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1713448273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916488318] [2022-04-15 17:55:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:10,662 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 17:55:10,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:10,663 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 17:55:10,681 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 17:55:10,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:10,682 INFO L87 Difference]: Start difference. First operand 309 states and 539 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 17:55:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:10,930 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions. [2022-04-15 17:55:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:10,930 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 17:55:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:10,930 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 17:55:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 17:55:10,932 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 17:55:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-15 17:55:10,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-15 17:55:11,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:11,067 INFO L225 Difference]: With dead ends: 573 [2022-04-15 17:55:11,068 INFO L226 Difference]: Without dead ends: 571 [2022-04-15 17:55:11,068 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 17:55:11,069 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:11,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-15 17:55:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-15 17:55:11,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:11,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:11,101 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:11,102 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:11,121 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-15 17:55:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-15 17:55:11,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:11,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:11,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 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 571 states. [2022-04-15 17:55:11,124 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 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 571 states. [2022-04-15 17:55:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:11,142 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-15 17:55:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-15 17:55:11,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:11,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:11,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:11,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions. [2022-04-15 17:55:11,159 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26 [2022-04-15 17:55:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:11,160 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions. [2022-04-15 17:55:11,160 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 17:55:11,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 731 transitions. [2022-04-15 17:55:11,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions. [2022-04-15 17:55:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 17:55:11,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:11,912 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 17:55:11,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:55:11,912 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times [2022-04-15 17:55:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:11,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218128288] [2022-04-15 17:55:11,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 2 times [2022-04-15 17:55:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:11,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285330912] [2022-04-15 17:55:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:11,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {13280#(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(16, 2);call #Ultimate.allocInit(12, 3); {13274#true} is VALID [2022-04-15 17:55:11,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-15 17:55:11,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-15 17:55:11,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {13274#true} call ULTIMATE.init(); {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:11,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {13280#(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(16, 2);call #Ultimate.allocInit(12, 3); {13274#true} is VALID [2022-04-15 17:55:11,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-15 17:55:11,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {13274#true} call #t~ret17 := main(); {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {13274#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;havoc ~cond~0; {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {13274#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {13274#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; {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {13274#true} assume !(0 != ~p1~0); {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {13274#true} assume !(0 != ~p2~0); {13274#true} is VALID [2022-04-15 17:55:11,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {13274#true} assume !(0 != ~p3~0); {13274#true} is VALID [2022-04-15 17:55:11,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {13274#true} assume !(0 != ~p4~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p10~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p1~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p2~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p3~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-15 17:55:11,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p4~0; {13275#false} is VALID [2022-04-15 17:55:11,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {13275#false} assume 1 != ~lk4~0; {13275#false} is VALID [2022-04-15 17:55:11,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {13275#false} assume !false; {13275#false} is VALID [2022-04-15 17:55:11,996 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 17:55:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:11,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285330912] [2022-04-15 17:55:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285330912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:11,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1218128288] [2022-04-15 17:55:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1218128288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609912438] [2022-04-15 17:55:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:11,998 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 17:55:11,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:11,998 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 17:55:12,016 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 17:55:12,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:12,017 INFO L87 Difference]: Start difference. First operand 425 states and 731 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 17:55:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:12,317 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions. [2022-04-15 17:55:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:12,317 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 17:55:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:12,317 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 17:55:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-15 17:55:12,319 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 17:55:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-15 17:55:12,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-15 17:55:12,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:12,510 INFO L225 Difference]: With dead ends: 1005 [2022-04-15 17:55:12,510 INFO L226 Difference]: Without dead ends: 595 [2022-04-15 17:55:12,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:55:12,512 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:12,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-15 17:55:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-15 17:55:12,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:12,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:12,559 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:12,560 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:12,579 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-15 17:55:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-15 17:55:12,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:12,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:12,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 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 595 states. [2022-04-15 17:55:12,582 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 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 595 states. [2022-04-15 17:55:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:12,603 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-15 17:55:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-15 17:55:12,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:12,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:12,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:12,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions. [2022-04-15 17:55:12,655 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26 [2022-04-15 17:55:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:12,655 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions. [2022-04-15 17:55:12,655 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 17:55:12,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 593 states and 1015 transitions. [2022-04-15 17:55:13,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions. [2022-04-15 17:55:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:55:13,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:13,660 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 17:55:13,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:55:13,660 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times [2022-04-15 17:55:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708561557] [2022-04-15 17:55:13,661 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 2 times [2022-04-15 17:55:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:13,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63032762] [2022-04-15 17:55:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:13,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {17678#(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(16, 2);call #Ultimate.allocInit(12, 3); {17672#true} is VALID [2022-04-15 17:55:13,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-15 17:55:13,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-15 17:55:13,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {17672#true} call ULTIMATE.init(); {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {17678#(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(16, 2);call #Ultimate.allocInit(12, 3); {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {17672#true} call #t~ret17 := main(); {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {17672#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;havoc ~cond~0; {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {17672#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {17672#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; {17672#true} is VALID [2022-04-15 17:55:13,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {17672#true} assume !(0 != ~p1~0); {17672#true} is VALID [2022-04-15 17:55:13,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#true} assume !(0 != ~p2~0); {17672#true} is VALID [2022-04-15 17:55:13,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {17672#true} assume !(0 != ~p3~0); {17672#true} is VALID [2022-04-15 17:55:13,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {17672#true} assume 0 != ~p4~0;~lk4~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-15 17:55:13,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {17673#false} is VALID [2022-04-15 17:55:13,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {17673#false} assume 0 != ~p5~0; {17673#false} is VALID [2022-04-15 17:55:13,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {17673#false} assume 1 != ~lk5~0; {17673#false} is VALID [2022-04-15 17:55:13,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {17673#false} assume !false; {17673#false} is VALID [2022-04-15 17:55:13,732 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 17:55:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63032762] [2022-04-15 17:55:13,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63032762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:13,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:13,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:13,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708561557] [2022-04-15 17:55:13,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708561557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:13,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:13,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709977526] [2022-04-15 17:55:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:13,734 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 17:55:13,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:13,735 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 17:55:13,751 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 17:55:13,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:13,752 INFO L87 Difference]: Start difference. First operand 593 states and 1015 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 17:55:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:14,069 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions. [2022-04-15 17:55:14,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:14,070 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 17:55:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:14,071 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 17:55:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-15 17:55:14,073 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 17:55:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-15 17:55:14,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-15 17:55:14,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:14,267 INFO L225 Difference]: With dead ends: 889 [2022-04-15 17:55:14,267 INFO L226 Difference]: Without dead ends: 603 [2022-04-15 17:55:14,268 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 17:55:14,269 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:14,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:55:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-15 17:55:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-15 17:55:14,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:14,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:14,316 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:14,318 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:14,339 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-15 17:55:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-15 17:55:14,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:14,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:14,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 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 603 states. [2022-04-15 17:55:14,342 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 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 603 states. [2022-04-15 17:55:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:14,362 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-15 17:55:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-15 17:55:14,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:14,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:14,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:14,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions. [2022-04-15 17:55:14,389 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27 [2022-04-15 17:55:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:14,389 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions. [2022-04-15 17:55:14,389 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 17:55:14,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 1015 transitions. [2022-04-15 17:55:15,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions. [2022-04-15 17:55:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:55:15,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:15,367 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 17:55:15,368 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:55:15,368 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times [2022-04-15 17:55:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999429477] [2022-04-15 17:55:15,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 2 times [2022-04-15 17:55:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542731547] [2022-04-15 17:55:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:15,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {21876#(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(16, 2);call #Ultimate.allocInit(12, 3); {21870#true} is VALID [2022-04-15 17:55:15,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-15 17:55:15,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-15 17:55:15,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {21870#true} call ULTIMATE.init(); {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:15,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {21876#(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(16, 2);call #Ultimate.allocInit(12, 3); {21870#true} is VALID [2022-04-15 17:55:15,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-15 17:55:15,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {21870#true} call #t~ret17 := main(); {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {21870#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;havoc ~cond~0; {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {21870#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {21870#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; {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {21870#true} assume !(0 != ~p1~0); {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {21870#true} assume !(0 != ~p2~0); {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#true} assume !(0 != ~p3~0); {21870#true} is VALID [2022-04-15 17:55:15,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {21870#true} assume !(0 != ~p4~0); {21870#true} is VALID [2022-04-15 17:55:15,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {21870#true} assume 0 != ~p5~0;~lk5~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p5~0; {21875#(= main_~lk5~0 1)} is VALID [2022-04-15 17:55:15,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {21875#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {21871#false} is VALID [2022-04-15 17:55:15,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {21871#false} assume !false; {21871#false} is VALID [2022-04-15 17:55:15,436 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 17:55:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:15,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542731547] [2022-04-15 17:55:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542731547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:15,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:15,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:15,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999429477] [2022-04-15 17:55:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999429477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:15,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:15,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042381063] [2022-04-15 17:55:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:15,438 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 17:55:15,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:15,438 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 17:55:15,454 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 17:55:15,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:15,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:15,456 INFO L87 Difference]: Start difference. First operand 601 states and 1015 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 17:55:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:15,812 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions. [2022-04-15 17:55:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:15,812 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 17:55:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:15,813 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 17:55:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 17:55:15,814 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 17:55:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-15 17:55:15,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-15 17:55:15,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:16,008 INFO L225 Difference]: With dead ends: 1101 [2022-04-15 17:55:16,009 INFO L226 Difference]: Without dead ends: 1099 [2022-04-15 17:55:16,009 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 17:55:16,010 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:16,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-15 17:55:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-15 17:55:16,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:16,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:16,078 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:16,079 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:16,135 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-15 17:55:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-15 17:55:16,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:16,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:16,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 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 1099 states. [2022-04-15 17:55:16,140 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 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 1099 states. [2022-04-15 17:55:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:16,197 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-15 17:55:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-15 17:55:16,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:16,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:16,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:16,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions. [2022-04-15 17:55:16,253 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27 [2022-04-15 17:55:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:16,254 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions. [2022-04-15 17:55:16,254 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 17:55:16,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1391 transitions. [2022-04-15 17:55:17,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions. [2022-04-15 17:55:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:55:17,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:17,635 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 17:55:17,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:55:17,636 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times [2022-04-15 17:55:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86291873] [2022-04-15 17:55:17,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 2 times [2022-04-15 17:55:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:17,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684384366] [2022-04-15 17:55:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:17,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {27970#(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(16, 2);call #Ultimate.allocInit(12, 3); {27964#true} is VALID [2022-04-15 17:55:17,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-15 17:55:17,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-15 17:55:17,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {27964#true} call ULTIMATE.init(); {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:17,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {27970#(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(16, 2);call #Ultimate.allocInit(12, 3); {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {27964#true} call #t~ret17 := main(); {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {27964#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;havoc ~cond~0; {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {27964#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {27964#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; {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {27964#true} assume !(0 != ~p1~0); {27964#true} is VALID [2022-04-15 17:55:17,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {27964#true} assume !(0 != ~p2~0); {27964#true} is VALID [2022-04-15 17:55:17,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {27964#true} assume !(0 != ~p3~0); {27964#true} is VALID [2022-04-15 17:55:17,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {27964#true} assume !(0 != ~p4~0); {27964#true} is VALID [2022-04-15 17:55:17,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {27964#true} assume !(0 != ~p5~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p10~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p1~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p2~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p3~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p4~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-15 17:55:17,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p5~0; {27965#false} is VALID [2022-04-15 17:55:17,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {27965#false} assume 1 != ~lk5~0; {27965#false} is VALID [2022-04-15 17:55:17,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {27965#false} assume !false; {27965#false} is VALID [2022-04-15 17:55:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:55:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684384366] [2022-04-15 17:55:17,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684384366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:17,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:17,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:17,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86291873] [2022-04-15 17:55:17,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86291873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:17,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:17,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059900452] [2022-04-15 17:55:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:17,684 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 17:55:17,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:17,684 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 17:55:17,701 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 17:55:17,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:17,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:17,702 INFO L87 Difference]: Start difference. First operand 841 states and 1391 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 17:55:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:18,253 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions. [2022-04-15 17:55:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:18,253 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 17:55:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:18,253 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 17:55:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-15 17:55:18,256 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 17:55:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-15 17:55:18,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-15 17:55:18,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:18,491 INFO L225 Difference]: With dead ends: 1981 [2022-04-15 17:55:18,491 INFO L226 Difference]: Without dead ends: 1163 [2022-04-15 17:55:18,492 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 17:55:18,494 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:18,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-15 17:55:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-15 17:55:18,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:18,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:18,600 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:18,601 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:18,660 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-15 17:55:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-15 17:55:18,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:18,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:18,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 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 1163 states. [2022-04-15 17:55:18,667 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 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 1163 states. [2022-04-15 17:55:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:18,728 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-15 17:55:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-15 17:55:18,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:18,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:18,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:18,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions. [2022-04-15 17:55:18,831 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27 [2022-04-15 17:55:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:18,831 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions. [2022-04-15 17:55:18,831 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 17:55:18,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1911 transitions. [2022-04-15 17:55:20,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions. [2022-04-15 17:55:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:55:20,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:20,739 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 17:55:20,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 17:55:20,740 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times [2022-04-15 17:55:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:20,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1563541697] [2022-04-15 17:55:20,741 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 2 times [2022-04-15 17:55:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497225755] [2022-04-15 17:55:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:20,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {36592#(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(16, 2);call #Ultimate.allocInit(12, 3); {36586#true} is VALID [2022-04-15 17:55:20,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-15 17:55:20,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-15 17:55:20,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {36586#true} call ULTIMATE.init(); {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:20,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {36592#(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(16, 2);call #Ultimate.allocInit(12, 3); {36586#true} is VALID [2022-04-15 17:55:20,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-15 17:55:20,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-15 17:55:20,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {36586#true} call #t~ret17 := main(); {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {36586#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;havoc ~cond~0; {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {36586#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {36586#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; {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {36586#true} assume !(0 != ~p1~0); {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {36586#true} assume !(0 != ~p2~0); {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {36586#true} assume !(0 != ~p3~0); {36586#true} is VALID [2022-04-15 17:55:20,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {36586#true} assume !(0 != ~p4~0); {36586#true} is VALID [2022-04-15 17:55:20,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {36586#true} assume 0 != ~p5~0;~lk5~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-15 17:55:20,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {36587#false} is VALID [2022-04-15 17:55:20,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {36587#false} assume 0 != ~p6~0; {36587#false} is VALID [2022-04-15 17:55:20,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {36587#false} assume 1 != ~lk6~0; {36587#false} is VALID [2022-04-15 17:55:20,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {36587#false} assume !false; {36587#false} is VALID [2022-04-15 17:55:20,803 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 17:55:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:20,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497225755] [2022-04-15 17:55:20,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497225755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:20,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:20,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:20,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:20,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1563541697] [2022-04-15 17:55:20,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1563541697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:20,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:20,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709146284] [2022-04-15 17:55:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:20,804 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 17:55:20,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:20,805 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 17:55:20,823 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 17:55:20,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:20,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:20,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:20,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:20,824 INFO L87 Difference]: Start difference. First operand 1161 states and 1911 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 17:55:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:21,248 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions. [2022-04-15 17:55:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:21,249 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 17:55:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:21,249 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 17:55:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 17:55:21,250 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 17:55:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-15 17:55:21,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-15 17:55:21,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:21,446 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 17:55:21,446 INFO L226 Difference]: Without dead ends: 1179 [2022-04-15 17:55:21,447 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 17:55:21,448 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:21,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-15 17:55:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-15 17:55:21,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:21,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:21,560 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:21,562 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:21,620 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-15 17:55:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-15 17:55:21,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:21,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:21,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 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 1179 states. [2022-04-15 17:55:21,625 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 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 1179 states. [2022-04-15 17:55:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:21,682 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-15 17:55:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-15 17:55:21,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:21,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:21,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:21,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions. [2022-04-15 17:55:21,785 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28 [2022-04-15 17:55:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:21,786 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions. [2022-04-15 17:55:21,786 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 17:55:21,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1911 transitions. [2022-04-15 17:55:23,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions. [2022-04-15 17:55:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:55:23,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:23,671 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 17:55:23,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 17:55:23,671 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times [2022-04-15 17:55:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:23,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [372128639] [2022-04-15 17:55:23,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 2 times [2022-04-15 17:55:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118761254] [2022-04-15 17:55:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:23,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {44798#(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(16, 2);call #Ultimate.allocInit(12, 3); {44792#true} is VALID [2022-04-15 17:55:23,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-15 17:55:23,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-15 17:55:23,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:23,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {44798#(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(16, 2);call #Ultimate.allocInit(12, 3); {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret17 := main(); {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#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;havoc ~cond~0; {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#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; {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} assume !(0 != ~p1~0); {44792#true} is VALID [2022-04-15 17:55:23,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#true} assume !(0 != ~p2~0); {44792#true} is VALID [2022-04-15 17:55:23,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#true} assume !(0 != ~p3~0); {44792#true} is VALID [2022-04-15 17:55:23,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#true} assume !(0 != ~p4~0); {44792#true} is VALID [2022-04-15 17:55:23,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#true} assume !(0 != ~p5~0); {44792#true} is VALID [2022-04-15 17:55:23,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {44792#true} assume 0 != ~p6~0;~lk6~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p6~0; {44797#(= main_~lk6~0 1)} is VALID [2022-04-15 17:55:23,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {44797#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {44793#false} is VALID [2022-04-15 17:55:23,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-15 17:55:23,738 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 17:55:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118761254] [2022-04-15 17:55:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118761254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:23,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:23,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:23,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [372128639] [2022-04-15 17:55:23,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [372128639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:23,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:23,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109558986] [2022-04-15 17:55:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:23,741 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 17:55:23,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:23,741 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 17:55:23,760 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 17:55:23,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:23,760 INFO L87 Difference]: Start difference. First operand 1177 states and 1911 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 17:55:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:24,251 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions. [2022-04-15 17:55:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:24,251 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 17:55:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:24,252 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 17:55:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 17:55:24,253 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 17:55:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-15 17:55:24,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-15 17:55:24,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:24,518 INFO L225 Difference]: With dead ends: 2125 [2022-04-15 17:55:24,518 INFO L226 Difference]: Without dead ends: 2123 [2022-04-15 17:55:24,519 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 17:55:24,519 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:24,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-15 17:55:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-15 17:55:24,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:24,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:24,682 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:24,684 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:24,800 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-15 17:55:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-15 17:55:24,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:24,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:24,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 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 2123 states. [2022-04-15 17:55:24,807 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 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 2123 states. [2022-04-15 17:55:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:24,951 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-15 17:55:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-15 17:55:24,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:24,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:24,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:24,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions. [2022-04-15 17:55:25,101 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28 [2022-04-15 17:55:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:25,101 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions. [2022-04-15 17:55:25,101 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 17:55:25,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1673 states and 2647 transitions. [2022-04-15 17:55:27,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2647 edges. 2647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions. [2022-04-15 17:55:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:55:27,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:27,660 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 17:55:27,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 17:55:27,661 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times [2022-04-15 17:55:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:27,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958103008] [2022-04-15 17:55:27,662 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 2 times [2022-04-15 17:55:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024515055] [2022-04-15 17:55:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:27,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {56652#(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(16, 2);call #Ultimate.allocInit(12, 3); {56646#true} is VALID [2022-04-15 17:55:27,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-15 17:55:27,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {56646#true} call ULTIMATE.init(); {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {56652#(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(16, 2);call #Ultimate.allocInit(12, 3); {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {56646#true} call #t~ret17 := main(); {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {56646#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;havoc ~cond~0; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {56646#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {56646#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; {56646#true} is VALID [2022-04-15 17:55:27,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {56646#true} assume !(0 != ~p1~0); {56646#true} is VALID [2022-04-15 17:55:27,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {56646#true} assume !(0 != ~p2~0); {56646#true} is VALID [2022-04-15 17:55:27,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {56646#true} assume !(0 != ~p3~0); {56646#true} is VALID [2022-04-15 17:55:27,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {56646#true} assume !(0 != ~p4~0); {56646#true} is VALID [2022-04-15 17:55:27,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {56646#true} assume !(0 != ~p5~0); {56646#true} is VALID [2022-04-15 17:55:27,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {56646#true} assume !(0 != ~p6~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p10~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p1~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p2~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p3~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p4~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p5~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-15 17:55:27,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p6~0; {56647#false} is VALID [2022-04-15 17:55:27,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {56647#false} assume 1 != ~lk6~0; {56647#false} is VALID [2022-04-15 17:55:27,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {56647#false} assume !false; {56647#false} is VALID [2022-04-15 17:55:27,729 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 17:55:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:27,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024515055] [2022-04-15 17:55:27,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024515055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:27,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:27,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:27,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958103008] [2022-04-15 17:55:27,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958103008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:27,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:27,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336735123] [2022-04-15 17:55:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:27,733 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 17:55:27,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:27,733 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 17:55:27,753 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 17:55:27,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:27,754 INFO L87 Difference]: Start difference. First operand 1673 states and 2647 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 17:55:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:28,749 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions. [2022-04-15 17:55:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:28,750 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 17:55:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:28,750 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 17:55:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-15 17:55:28,751 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 17:55:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-15 17:55:28,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-15 17:55:28,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:29,087 INFO L225 Difference]: With dead ends: 3917 [2022-04-15 17:55:29,087 INFO L226 Difference]: Without dead ends: 2283 [2022-04-15 17:55:29,090 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 17:55:29,090 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:29,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-15 17:55:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-15 17:55:29,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:29,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:29,275 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:29,276 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:29,445 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-15 17:55:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-15 17:55:29,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:29,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:29,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 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 2283 states. [2022-04-15 17:55:29,453 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 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 2283 states. [2022-04-15 17:55:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:29,603 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-15 17:55:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-15 17:55:29,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:29,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:29,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:29,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions. [2022-04-15 17:55:29,841 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28 [2022-04-15 17:55:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:29,841 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions. [2022-04-15 17:55:29,841 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 17:55:29,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2281 states and 3591 transitions. [2022-04-15 17:55:33,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions. [2022-04-15 17:55:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:55:33,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:33,444 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 17:55:33,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 17:55:33,444 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times [2022-04-15 17:55:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:33,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388687574] [2022-04-15 17:55:33,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 2 times [2022-04-15 17:55:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:33,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380369653] [2022-04-15 17:55:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:33,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:33,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {73626#(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(16, 2);call #Ultimate.allocInit(12, 3); {73620#true} is VALID [2022-04-15 17:55:33,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-15 17:55:33,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {73620#true} call ULTIMATE.init(); {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:33,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {73626#(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(16, 2);call #Ultimate.allocInit(12, 3); {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {73620#true} call #t~ret17 := main(); {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {73620#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;havoc ~cond~0; {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {73620#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {73620#true} is VALID [2022-04-15 17:55:33,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {73620#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; {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {73620#true} assume !(0 != ~p1~0); {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {73620#true} assume !(0 != ~p2~0); {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {73620#true} assume !(0 != ~p3~0); {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {73620#true} assume !(0 != ~p4~0); {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {73620#true} assume !(0 != ~p5~0); {73620#true} is VALID [2022-04-15 17:55:33,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {73620#true} assume 0 != ~p6~0;~lk6~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-15 17:55:33,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {73621#false} is VALID [2022-04-15 17:55:33,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {73621#false} assume 0 != ~p7~0; {73621#false} is VALID [2022-04-15 17:55:33,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {73621#false} assume 1 != ~lk7~0; {73621#false} is VALID [2022-04-15 17:55:33,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {73621#false} assume !false; {73621#false} is VALID [2022-04-15 17:55:33,485 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 17:55:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380369653] [2022-04-15 17:55:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380369653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:33,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:33,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:33,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:33,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388687574] [2022-04-15 17:55:33,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388687574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:33,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:33,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108561508] [2022-04-15 17:55:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:33,487 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 17:55:33,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:33,487 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 17:55:33,506 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 17:55:33,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:33,506 INFO L87 Difference]: Start difference. First operand 2281 states and 3591 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 17:55:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:34,336 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions. [2022-04-15 17:55:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:34,336 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 17:55:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:34,337 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 17:55:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 17:55:34,338 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 17:55:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-15 17:55:34,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-15 17:55:34,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:34,682 INFO L225 Difference]: With dead ends: 3421 [2022-04-15 17:55:34,682 INFO L226 Difference]: Without dead ends: 2315 [2022-04-15 17:55:34,683 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 17:55:34,684 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:34,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-15 17:55:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-15 17:55:34,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:34,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:34,890 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:34,892 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:35,086 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-15 17:55:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-15 17:55:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:35,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 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 2315 states. [2022-04-15 17:55:35,092 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 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 2315 states. [2022-04-15 17:55:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:35,244 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-15 17:55:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-15 17:55:35,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:35,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:35,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:35,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions. [2022-04-15 17:55:35,486 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29 [2022-04-15 17:55:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:35,486 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions. [2022-04-15 17:55:35,486 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 17:55:35,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 3591 transitions. [2022-04-15 17:55:39,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions. [2022-04-15 17:55:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:55:39,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:39,158 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 17:55:39,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 17:55:39,158 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times [2022-04-15 17:55:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:39,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493858157] [2022-04-15 17:55:39,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 2 times [2022-04-15 17:55:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:39,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362643580] [2022-04-15 17:55:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:39,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {89736#(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(16, 2);call #Ultimate.allocInit(12, 3); {89730#true} is VALID [2022-04-15 17:55:39,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-15 17:55:39,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-15 17:55:39,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {89730#true} call ULTIMATE.init(); {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:39,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {89736#(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(16, 2);call #Ultimate.allocInit(12, 3); {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {89730#true} call #t~ret17 := main(); {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {89730#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;havoc ~cond~0; {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {89730#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {89730#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; {89730#true} is VALID [2022-04-15 17:55:39,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {89730#true} assume !(0 != ~p1~0); {89730#true} is VALID [2022-04-15 17:55:39,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {89730#true} assume !(0 != ~p2~0); {89730#true} is VALID [2022-04-15 17:55:39,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {89730#true} assume !(0 != ~p3~0); {89730#true} is VALID [2022-04-15 17:55:39,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {89730#true} assume !(0 != ~p4~0); {89730#true} is VALID [2022-04-15 17:55:39,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {89730#true} assume !(0 != ~p5~0); {89730#true} is VALID [2022-04-15 17:55:39,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {89730#true} assume !(0 != ~p6~0); {89730#true} is VALID [2022-04-15 17:55:39,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {89730#true} assume 0 != ~p7~0;~lk7~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p7~0; {89735#(= main_~lk7~0 1)} is VALID [2022-04-15 17:55:39,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {89735#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {89731#false} is VALID [2022-04-15 17:55:39,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {89731#false} assume !false; {89731#false} is VALID [2022-04-15 17:55:39,207 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 17:55:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362643580] [2022-04-15 17:55:39,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362643580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:39,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:39,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:39,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:39,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493858157] [2022-04-15 17:55:39,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493858157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:39,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:39,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623633835] [2022-04-15 17:55:39,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:39,209 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 17:55:39,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:39,209 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 17:55:39,227 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 17:55:39,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:39,228 INFO L87 Difference]: Start difference. First operand 2313 states and 3591 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 17:55:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:40,457 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions. [2022-04-15 17:55:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:40,457 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 17:55:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:40,457 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 17:55:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 17:55:40,458 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 17:55:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-15 17:55:40,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-15 17:55:40,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:41,247 INFO L225 Difference]: With dead ends: 4109 [2022-04-15 17:55:41,248 INFO L226 Difference]: Without dead ends: 4107 [2022-04-15 17:55:41,248 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 17:55:41,249 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:41,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-15 17:55:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-15 17:55:41,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:41,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:41,577 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:41,580 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:42,046 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-15 17:55:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-15 17:55:42,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:42,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:42,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 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 4107 states. [2022-04-15 17:55:42,056 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 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 4107 states. [2022-04-15 17:55:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:42,530 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-15 17:55:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-15 17:55:42,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:42,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:42,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:42,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions. [2022-04-15 17:55:43,065 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29 [2022-04-15 17:55:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:43,065 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions. [2022-04-15 17:55:43,066 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 17:55:43,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 5031 transitions. [2022-04-15 17:55:48,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5031 edges. 5031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions. [2022-04-15 17:55:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:55:48,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:55:48,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, 1, 1, 1, 1] [2022-04-15 17:55:48,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 17:55:48,168 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:55:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:55:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times [2022-04-15 17:55:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506007100] [2022-04-15 17:55:48,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:55:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 2 times [2022-04-15 17:55:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:55:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226747894] [2022-04-15 17:55:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:55:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:55:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:55:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:55:48,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {112854#(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(16, 2);call #Ultimate.allocInit(12, 3); {112848#true} is VALID [2022-04-15 17:55:48,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-15 17:55:48,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-15 17:55:48,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {112848#true} call ULTIMATE.init(); {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {112854#(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(16, 2);call #Ultimate.allocInit(12, 3); {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {112848#true} call #t~ret17 := main(); {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {112848#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;havoc ~cond~0; {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {112848#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {112848#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; {112848#true} is VALID [2022-04-15 17:55:48,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {112848#true} assume !(0 != ~p1~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {112848#true} assume !(0 != ~p2~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {112848#true} assume !(0 != ~p3~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {112848#true} assume !(0 != ~p4~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {112848#true} assume !(0 != ~p5~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {112848#true} assume !(0 != ~p6~0); {112848#true} is VALID [2022-04-15 17:55:48,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {112848#true} assume !(0 != ~p7~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p10~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p1~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p2~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p3~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p4~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p5~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p6~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-15 17:55:48,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p7~0; {112849#false} is VALID [2022-04-15 17:55:48,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {112849#false} assume 1 != ~lk7~0; {112849#false} is VALID [2022-04-15 17:55:48,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {112849#false} assume !false; {112849#false} is VALID [2022-04-15 17:55:48,231 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 17:55:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:55:48,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226747894] [2022-04-15 17:55:48,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226747894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:48,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:48,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:48,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:55:48,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506007100] [2022-04-15 17:55:48,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506007100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:55:48,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:55:48,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:55:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589470663] [2022-04-15 17:55:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:55:48,233 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 17:55:48,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:55:48,233 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 17:55:48,250 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 17:55:48,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:55:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:55:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:55:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:55:48,251 INFO L87 Difference]: Start difference. First operand 3337 states and 5031 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 17:55:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:51,158 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions. [2022-04-15 17:55:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:55:51,158 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 17:55:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:55:51,158 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 17:55:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 17:55:51,160 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 17:55:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-15 17:55:51,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-15 17:55:51,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:55:52,111 INFO L225 Difference]: With dead ends: 7757 [2022-04-15 17:55:52,111 INFO L226 Difference]: Without dead ends: 4491 [2022-04-15 17:55:52,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:55:52,116 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:55:52,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:55:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-15 17:55:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-15 17:55:52,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:55:52,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:52,500 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:52,503 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:53,035 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-15 17:55:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-15 17:55:53,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:53,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:53,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 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 4491 states. [2022-04-15 17:55:53,048 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 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 4491 states. [2022-04-15 17:55:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:55:53,601 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-15 17:55:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-15 17:55:53,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:55:53,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:55:53,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:55:53,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:55:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:55:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions. [2022-04-15 17:55:54,541 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29 [2022-04-15 17:55:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:55:54,541 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions. [2022-04-15 17:55:54,541 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 17:55:54,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4489 states and 6727 transitions. [2022-04-15 17:56:01,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions. [2022-04-15 17:56:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:56:01,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:56:01,585 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 17:56:01,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 17:56:01,586 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:56:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:56:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times [2022-04-15 17:56:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:01,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219488277] [2022-04-15 17:56:01,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:56:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 2 times [2022-04-15 17:56:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:56:01,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834334936] [2022-04-15 17:56:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:56:01,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:56:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:01,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:56:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:01,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {146340#(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(16, 2);call #Ultimate.allocInit(12, 3); {146334#true} is VALID [2022-04-15 17:56:01,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 17:56:01,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {146340#(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(16, 2);call #Ultimate.allocInit(12, 3); {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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;havoc ~cond~0; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#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; {146334#true} is VALID [2022-04-15 17:56:01,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#true} assume !(0 != ~p1~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} assume !(0 != ~p2~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#true} assume !(0 != ~p3~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} assume !(0 != ~p4~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#true} assume !(0 != ~p5~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} assume !(0 != ~p6~0); {146334#true} is VALID [2022-04-15 17:56:01,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#true} assume 0 != ~p7~0;~lk7~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-15 17:56:01,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {146335#false} is VALID [2022-04-15 17:56:01,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {146335#false} assume 0 != ~p8~0; {146335#false} is VALID [2022-04-15 17:56:01,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {146335#false} assume 1 != ~lk8~0; {146335#false} is VALID [2022-04-15 17:56:01,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-15 17:56:01,631 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 17:56:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:56:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834334936] [2022-04-15 17:56:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834334936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:01,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:01,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:01,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:56:01,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219488277] [2022-04-15 17:56:01,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219488277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:01,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:01,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283724042] [2022-04-15 17:56:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:56:01,633 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 17:56:01,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:56:01,633 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 17:56:01,652 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 17:56:01,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:56:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:56:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:56:01,653 INFO L87 Difference]: Start difference. First operand 4489 states and 6727 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 17:56:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:04,027 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions. [2022-04-15 17:56:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:56:04,027 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 17:56:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:56:04,028 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 17:56:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 17:56:04,029 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 17:56:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-15 17:56:04,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-15 17:56:04,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:04,973 INFO L225 Difference]: With dead ends: 6733 [2022-04-15 17:56:04,973 INFO L226 Difference]: Without dead ends: 4555 [2022-04-15 17:56:04,976 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 17:56:04,977 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:56:04,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:56:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-15 17:56:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-15 17:56:05,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:56:05,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:05,402 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:05,405 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:05,949 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-15 17:56:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-15 17:56:05,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:05,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:05,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 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 4555 states. [2022-04-15 17:56:05,966 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 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 4555 states. [2022-04-15 17:56:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:06,565 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-15 17:56:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-15 17:56:06,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:06,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:06,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:56:06,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:56:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions. [2022-04-15 17:56:07,610 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30 [2022-04-15 17:56:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:56:07,610 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions. [2022-04-15 17:56:07,610 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 17:56:07,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4553 states and 6727 transitions. [2022-04-15 17:56:14,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions. [2022-04-15 17:56:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:56:14,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:56:14,849 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 17:56:14,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 17:56:14,850 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:56:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:56:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times [2022-04-15 17:56:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255734437] [2022-04-15 17:56:14,850 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:56:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 2 times [2022-04-15 17:56:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:56:14,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544666749] [2022-04-15 17:56:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:56:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:56:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:56:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:14,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {178034#(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(16, 2);call #Ultimate.allocInit(12, 3); {178028#true} is VALID [2022-04-15 17:56:14,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-15 17:56:14,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-15 17:56:14,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {178028#true} call ULTIMATE.init(); {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:56:14,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {178034#(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(16, 2);call #Ultimate.allocInit(12, 3); {178028#true} is VALID [2022-04-15 17:56:14,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-15 17:56:14,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-15 17:56:14,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {178028#true} call #t~ret17 := main(); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {178028#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;havoc ~cond~0; {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {178028#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {178028#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; {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {178028#true} assume !(0 != ~p1~0); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {178028#true} assume !(0 != ~p2~0); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {178028#true} assume !(0 != ~p3~0); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {178028#true} assume !(0 != ~p4~0); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {178028#true} assume !(0 != ~p5~0); {178028#true} is VALID [2022-04-15 17:56:14,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {178028#true} assume !(0 != ~p6~0); {178028#true} is VALID [2022-04-15 17:56:14,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {178028#true} assume !(0 != ~p7~0); {178028#true} is VALID [2022-04-15 17:56:14,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {178028#true} assume 0 != ~p8~0;~lk8~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p8~0; {178033#(= main_~lk8~0 1)} is VALID [2022-04-15 17:56:14,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {178033#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {178029#false} is VALID [2022-04-15 17:56:14,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {178029#false} assume !false; {178029#false} is VALID [2022-04-15 17:56:14,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 17:56:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:56:14,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544666749] [2022-04-15 17:56:14,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544666749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:14,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:14,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:14,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:56:14,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255734437] [2022-04-15 17:56:14,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255734437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:14,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:14,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694450233] [2022-04-15 17:56:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:56:14,898 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 17:56:14,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:56:14,898 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 17:56:14,916 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 17:56:14,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:56:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:56:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:56:14,917 INFO L87 Difference]: Start difference. First operand 4553 states and 6727 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 17:56:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:18,239 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions. [2022-04-15 17:56:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:56:18,240 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 17:56:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:56:18,240 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 17:56:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 17:56:18,241 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 17:56:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 17:56:18,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 17:56:18,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:20,864 INFO L225 Difference]: With dead ends: 7949 [2022-04-15 17:56:20,864 INFO L226 Difference]: Without dead ends: 7947 [2022-04-15 17:56:20,865 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 17:56:20,866 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:56:20,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:56:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-15 17:56:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-15 17:56:21,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:56:21,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:21,390 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:23,074 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-15 17:56:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-15 17:56:23,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:23,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:23,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 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 7947 states. [2022-04-15 17:56:23,095 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 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 7947 states. [2022-04-15 17:56:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:24,832 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-15 17:56:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-15 17:56:24,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:24,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:24,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:56:24,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:56:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions. [2022-04-15 17:56:26,876 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30 [2022-04-15 17:56:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:56:26,877 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions. [2022-04-15 17:56:26,877 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 17:56:26,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 9543 transitions. [2022-04-15 17:56:37,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9543 edges. 9543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions. [2022-04-15 17:56:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 17:56:37,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:56:37,016 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 17:56:37,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 17:56:37,016 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:56:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:56:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times [2022-04-15 17:56:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302203857] [2022-04-15 17:56:37,017 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:56:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 2 times [2022-04-15 17:56:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:56:37,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149215147] [2022-04-15 17:56:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:56:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:56:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:56:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:56:37,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {223168#(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(16, 2);call #Ultimate.allocInit(12, 3); {223162#true} is VALID [2022-04-15 17:56:37,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-15 17:56:37,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-15 17:56:37,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {223162#true} call ULTIMATE.init(); {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:56:37,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {223168#(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(16, 2);call #Ultimate.allocInit(12, 3); {223162#true} is VALID [2022-04-15 17:56:37,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {223162#true} call #t~ret17 := main(); {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {223162#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;havoc ~cond~0; {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {223162#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {223162#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; {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {223162#true} assume !(0 != ~p1~0); {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {223162#true} assume !(0 != ~p2~0); {223162#true} is VALID [2022-04-15 17:56:37,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {223162#true} assume !(0 != ~p3~0); {223162#true} is VALID [2022-04-15 17:56:37,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {223162#true} assume !(0 != ~p4~0); {223162#true} is VALID [2022-04-15 17:56:37,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {223162#true} assume !(0 != ~p5~0); {223162#true} is VALID [2022-04-15 17:56:37,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {223162#true} assume !(0 != ~p6~0); {223162#true} is VALID [2022-04-15 17:56:37,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {223162#true} assume !(0 != ~p7~0); {223162#true} is VALID [2022-04-15 17:56:37,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {223162#true} assume !(0 != ~p8~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p10~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p1~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p2~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p3~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p4~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p5~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p6~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p7~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-15 17:56:37,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p8~0; {223163#false} is VALID [2022-04-15 17:56:37,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {223163#false} assume 1 != ~lk8~0; {223163#false} is VALID [2022-04-15 17:56:37,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {223163#false} assume !false; {223163#false} is VALID [2022-04-15 17:56:37,077 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 17:56:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:56:37,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149215147] [2022-04-15 17:56:37,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149215147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:37,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:37,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:37,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:56:37,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302203857] [2022-04-15 17:56:37,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302203857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:56:37,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:56:37,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:56:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144588087] [2022-04-15 17:56:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:56:37,078 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 17:56:37,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:56:37,079 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 17:56:37,098 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 17:56:37,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:56:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:56:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:56:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:56:37,099 INFO L87 Difference]: Start difference. First operand 6665 states and 9543 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 17:56:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:48,067 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions. [2022-04-15 17:56:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:56:48,067 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 17:56:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:56:48,067 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 17:56:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-15 17:56:48,069 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 17:56:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-15 17:56:48,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-15 17:56:48,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:56:51,383 INFO L225 Difference]: With dead ends: 15373 [2022-04-15 17:56:51,383 INFO L226 Difference]: Without dead ends: 8843 [2022-04-15 17:56:51,390 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 17:56:51,390 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:56:51,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:56:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-15 17:56:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-15 17:56:52,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:56:52,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:52,122 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:52,130 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:54,185 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-15 17:56:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-15 17:56:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:54,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:54,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 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 8843 states. [2022-04-15 17:56:54,210 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 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 8843 states. [2022-04-15 17:56:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:56:56,329 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-15 17:56:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-15 17:56:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:56:56,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:56:56,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:56:56,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:56:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:56:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions. [2022-04-15 17:56:59,695 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30 [2022-04-15 17:56:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:56:59,696 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions. [2022-04-15 17:56:59,696 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 17:56:59,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8841 states and 12551 transitions. [2022-04-15 17:57:13,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:57:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions. [2022-04-15 17:57:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 17:57:13,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:57:13,699 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 17:57:13,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 17:57:13,700 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:57:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:57:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times [2022-04-15 17:57:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:57:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398552015] [2022-04-15 17:57:13,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:57:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 2 times [2022-04-15 17:57:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:57:13,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401900772] [2022-04-15 17:57:13,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:57:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:57:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:57:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:57:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:57:13,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {289294#(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(16, 2);call #Ultimate.allocInit(12, 3); {289288#true} is VALID [2022-04-15 17:57:13,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-15 17:57:13,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-15 17:57:13,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {289288#true} call ULTIMATE.init(); {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:57:13,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {289294#(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(16, 2);call #Ultimate.allocInit(12, 3); {289288#true} is VALID [2022-04-15 17:57:13,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-15 17:57:13,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {289288#true} call #t~ret17 := main(); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {289288#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;havoc ~cond~0; {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {289288#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {289288#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; {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {289288#true} assume !(0 != ~p1~0); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {289288#true} assume !(0 != ~p2~0); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {289288#true} assume !(0 != ~p3~0); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {289288#true} assume !(0 != ~p4~0); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {289288#true} assume !(0 != ~p5~0); {289288#true} is VALID [2022-04-15 17:57:13,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {289288#true} assume !(0 != ~p6~0); {289288#true} is VALID [2022-04-15 17:57:13,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {289288#true} assume !(0 != ~p7~0); {289288#true} is VALID [2022-04-15 17:57:13,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {289288#true} assume 0 != ~p8~0;~lk8~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-15 17:57:13,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {289289#false} is VALID [2022-04-15 17:57:13,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {289289#false} assume 0 != ~p9~0; {289289#false} is VALID [2022-04-15 17:57:13,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {289289#false} assume 1 != ~lk9~0; {289289#false} is VALID [2022-04-15 17:57:13,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {289289#false} assume !false; {289289#false} is VALID [2022-04-15 17:57:13,745 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 17:57:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:57:13,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401900772] [2022-04-15 17:57:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401900772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:57:13,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:57:13,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:57:13,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:57:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398552015] [2022-04-15 17:57:13,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398552015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:57:13,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:57:13,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:57:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54839750] [2022-04-15 17:57:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:57:13,748 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 17:57:13,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:57:13,748 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 17:57:13,766 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 17:57:13,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:57:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:57:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:57:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:57:13,767 INFO L87 Difference]: Start difference. First operand 8841 states and 12551 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 17:57:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:22,628 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions. [2022-04-15 17:57:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:57:22,628 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 17:57:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:57:22,628 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 17:57:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-15 17:57:22,629 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 17:57:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-15 17:57:22,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-15 17:57:22,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:57:26,151 INFO L225 Difference]: With dead ends: 13261 [2022-04-15 17:57:26,151 INFO L226 Difference]: Without dead ends: 8971 [2022-04-15 17:57:26,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:57:26,157 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:57:26,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:57:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-15 17:57:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-15 17:57:26,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:57:26,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:57:26,896 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:57:26,905 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:57:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:28,957 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-15 17:57:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-15 17:57:28,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:57:28,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:57:28,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 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 8971 states. [2022-04-15 17:57:28,987 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 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 8971 states. [2022-04-15 17:57:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:57:31,275 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-15 17:57:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-15 17:57:31,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:57:31,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:57:31,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:57:31,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:57:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:57:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions. [2022-04-15 17:57:34,733 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31 [2022-04-15 17:57:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:57:34,733 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions. [2022-04-15 17:57:34,733 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 17:57:34,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8969 states and 12551 transitions. [2022-04-15 17:57:48,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:57:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions. [2022-04-15 17:57:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 17:57:48,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:57:48,805 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 17:57:48,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 17:57:48,805 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:57:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:57:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times [2022-04-15 17:57:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:57:48,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032607942] [2022-04-15 17:57:48,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:57:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 2 times [2022-04-15 17:57:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:57:48,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493000131] [2022-04-15 17:57:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:57:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:57:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:57:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:57:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:57:48,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {351708#(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(16, 2);call #Ultimate.allocInit(12, 3); {351702#true} is VALID [2022-04-15 17:57:48,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-15 17:57:48,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-15 17:57:48,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {351702#true} call ULTIMATE.init(); {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:57:48,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {351708#(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(16, 2);call #Ultimate.allocInit(12, 3); {351702#true} is VALID [2022-04-15 17:57:48,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-15 17:57:48,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-15 17:57:48,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {351702#true} call #t~ret17 := main(); {351702#true} is VALID [2022-04-15 17:57:48,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {351702#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;havoc ~cond~0; {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {351702#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {351702#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; {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {351702#true} assume !(0 != ~p1~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {351702#true} assume !(0 != ~p2~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {351702#true} assume !(0 != ~p3~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {351702#true} assume !(0 != ~p4~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {351702#true} assume !(0 != ~p5~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {351702#true} assume !(0 != ~p6~0); {351702#true} is VALID [2022-04-15 17:57:48,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {351702#true} assume !(0 != ~p7~0); {351702#true} is VALID [2022-04-15 17:57:48,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {351702#true} assume !(0 != ~p8~0); {351702#true} is VALID [2022-04-15 17:57:48,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {351702#true} assume 0 != ~p9~0;~lk9~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p9~0; {351707#(= main_~lk9~0 1)} is VALID [2022-04-15 17:57:48,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {351707#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {351703#false} is VALID [2022-04-15 17:57:48,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {351703#false} assume !false; {351703#false} is VALID [2022-04-15 17:57:48,866 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 17:57:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:57:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493000131] [2022-04-15 17:57:48,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493000131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:57:48,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:57:48,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:57:48,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:57:48,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032607942] [2022-04-15 17:57:48,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032607942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:57:48,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:57:48,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:57:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122350131] [2022-04-15 17:57:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:57:48,867 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 17:57:48,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:57:48,867 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 17:57:48,888 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 17:57:48,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:57:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:57:48,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:57:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:57:48,889 INFO L87 Difference]: Start difference. First operand 8969 states and 12551 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 17:58:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:00,920 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions. [2022-04-15 17:58:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:58:00,920 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 17:58:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:58:00,921 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 17:58:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 17:58:00,921 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 17:58:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 17:58:00,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 17:58:01,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:11,846 INFO L225 Difference]: With dead ends: 15373 [2022-04-15 17:58:11,846 INFO L226 Difference]: Without dead ends: 15371 [2022-04-15 17:58:11,849 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 17:58:11,850 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:58:11,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:58:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-15 17:58:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-15 17:58:12,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:58:13,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:13,018 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:13,034 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:20,229 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-15 17:58:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-15 17:58:20,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:20,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:20,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 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 15371 states. [2022-04-15 17:58:20,278 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 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 15371 states. [2022-04-15 17:58:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:58:27,611 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-15 17:58:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-15 17:58:27,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:58:27,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:58:27,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:58:27,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:58:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:58:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions. [2022-04-15 17:58:36,626 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31 [2022-04-15 17:58:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:58:36,626 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions. [2022-04-15 17:58:36,626 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 17:58:36,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13321 states and 18055 transitions. [2022-04-15 17:58:57,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18055 edges. 18055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:58:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions. [2022-04-15 17:58:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 17:58:57,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:58:57,298 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 17:58:57,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 17:58:57,298 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:58:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:58:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times [2022-04-15 17:58:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865874443] [2022-04-15 17:58:57,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:58:57,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 2 times [2022-04-15 17:58:57,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:58:57,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159454513] [2022-04-15 17:58:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:58:57,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:58:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:58:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:58:57,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {439850#(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(16, 2);call #Ultimate.allocInit(12, 3); {439844#true} is VALID [2022-04-15 17:58:57,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-15 17:58:57,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-15 17:58:57,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {439844#true} call ULTIMATE.init(); {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {439850#(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(16, 2);call #Ultimate.allocInit(12, 3); {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {439844#true} call #t~ret17 := main(); {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {439844#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;havoc ~cond~0; {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {439844#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {439844#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; {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {439844#true} assume !(0 != ~p1~0); {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {439844#true} assume !(0 != ~p2~0); {439844#true} is VALID [2022-04-15 17:58:57,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {439844#true} assume !(0 != ~p3~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {439844#true} assume !(0 != ~p4~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {439844#true} assume !(0 != ~p5~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {439844#true} assume !(0 != ~p6~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {439844#true} assume !(0 != ~p7~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {439844#true} assume !(0 != ~p8~0); {439844#true} is VALID [2022-04-15 17:58:57,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {439844#true} assume !(0 != ~p9~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p10~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p1~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p2~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p3~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p4~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p5~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p6~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p7~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p8~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-15 17:58:57,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p9~0; {439845#false} is VALID [2022-04-15 17:58:57,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {439845#false} assume 1 != ~lk9~0; {439845#false} is VALID [2022-04-15 17:58:57,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {439845#false} assume !false; {439845#false} is VALID [2022-04-15 17:58:57,339 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 17:58:57,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:58:57,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159454513] [2022-04-15 17:58:57,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159454513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:57,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:57,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:57,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:58:57,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865874443] [2022-04-15 17:58:57,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865874443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:58:57,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:58:57,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:58:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588448750] [2022-04-15 17:58:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:58:57,341 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 17:58:57,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:58:57,341 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 17:58:57,359 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 17:58:57,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:58:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:58:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:58:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:58:57,360 INFO L87 Difference]: Start difference. First operand 13321 states and 18055 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 17:59:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:59:59,701 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions. [2022-04-15 17:59:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:59:59,701 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 17:59:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:59:59,701 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 17:59:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 17:59:59,702 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 17:59:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-15 17:59:59,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-15 17:59:59,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:00:15,658 INFO L225 Difference]: With dead ends: 30477 [2022-04-15 18:00:15,659 INFO L226 Difference]: Without dead ends: 17419 [2022-04-15 18:00:15,677 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 18:00:15,679 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:00:15,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:00:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-15 18:00:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-15 18:00:17,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:00:17,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:17,805 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:17,832 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:28,184 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-15 18:00:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-15 18:00:28,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:28,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:28,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 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 17419 states. [2022-04-15 18:00:28,240 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 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 17419 states. [2022-04-15 18:00:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:00:37,328 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-15 18:00:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-15 18:00:37,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:00:37,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:00:37,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:00:37,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:00:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:00:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions. [2022-04-15 18:00:56,630 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31 [2022-04-15 18:00:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:00:56,630 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions. [2022-04-15 18:00:56,630 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 18:00:56,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17417 states and 23303 transitions. [2022-04-15 18:01:26,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:01:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions. [2022-04-15 18:01:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:01:26,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:01:26,684 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 18:01:26,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 18:01:26,685 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:01:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:01:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times [2022-04-15 18:01:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:26,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373854943] [2022-04-15 18:01:26,686 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:01:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 2 times [2022-04-15 18:01:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:01:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969019267] [2022-04-15 18:01:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:01:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:01:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:01:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:01:26,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {570488#(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(16, 2);call #Ultimate.allocInit(12, 3); {570482#true} is VALID [2022-04-15 18:01:26,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-15 18:01:26,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {570482#true} call ULTIMATE.init(); {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:01:26,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {570488#(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(16, 2);call #Ultimate.allocInit(12, 3); {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {570482#true} call #t~ret17 := main(); {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {570482#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;havoc ~cond~0; {570482#true} is VALID [2022-04-15 18:01:26,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {570482#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {570482#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; {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {570482#true} assume !(0 != ~p1~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {570482#true} assume !(0 != ~p2~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {570482#true} assume !(0 != ~p3~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {570482#true} assume !(0 != ~p4~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {570482#true} assume !(0 != ~p5~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {570482#true} assume !(0 != ~p6~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {570482#true} assume !(0 != ~p7~0); {570482#true} is VALID [2022-04-15 18:01:26,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {570482#true} assume !(0 != ~p8~0); {570482#true} is VALID [2022-04-15 18:01:26,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {570482#true} assume 0 != ~p9~0;~lk9~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-15 18:01:26,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {570483#false} is VALID [2022-04-15 18:01:26,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {570483#false} assume 0 != ~p10~0; {570483#false} is VALID [2022-04-15 18:01:26,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {570483#false} assume 1 != ~lk10~0; {570483#false} is VALID [2022-04-15 18:01:26,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {570483#false} assume !false; {570483#false} is VALID [2022-04-15 18:01:26,735 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 18:01:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:01:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969019267] [2022-04-15 18:01:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969019267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:26,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:26,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:26,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:01:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373854943] [2022-04-15 18:01:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373854943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:01:26,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:01:26,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:01:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228362818] [2022-04-15 18:01:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:01:26,737 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 18:01:26,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:01:26,737 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 18:01:26,758 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 18:01:26,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:01:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:01:26,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:01:26,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:01:26,760 INFO L87 Difference]: Start difference. First operand 17417 states and 23303 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 18:02:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:02:41,896 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions. [2022-04-15 18:02:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:02:41,897 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 18:02:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:02:41,897 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 18:02:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 18:02:41,898 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 18:02:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-15 18:02:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-15 18:02:42,026 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 18:02:59,825 INFO L225 Difference]: With dead ends: 26125 [2022-04-15 18:02:59,825 INFO L226 Difference]: Without dead ends: 17675 [2022-04-15 18:02:59,839 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 18:02:59,840 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:02:59,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:02:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-15 18:03:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-15 18:03:01,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:01,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:01,926 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:01,948 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:11,351 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-15 18:03:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-15 18:03:11,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:11,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:11,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 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 17675 states. [2022-04-15 18:03:11,421 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 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 17675 states. [2022-04-15 18:03:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:24,077 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-15 18:03:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-15 18:03:24,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:24,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:24,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:24,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions. [2022-04-15 18:03:42,309 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32 [2022-04-15 18:03:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:42,309 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions. [2022-04-15 18:03:42,309 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 18:03:42,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17673 states and 23303 transitions. [2022-04-15 18:04:11,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions. [2022-04-15 18:04:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 18:04:11,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:11,207 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 18:04:11,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 18:04:11,208 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times [2022-04-15 18:04:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:11,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663136456] [2022-04-15 18:04:11,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 2 times [2022-04-15 18:04:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143537539] [2022-04-15 18:04:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:11,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {693446#(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(16, 2);call #Ultimate.allocInit(12, 3); {693440#true} is VALID [2022-04-15 18:04:11,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-15 18:04:11,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-15 18:04:11,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {693440#true} call ULTIMATE.init(); {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:04:11,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {693446#(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(16, 2);call #Ultimate.allocInit(12, 3); {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {693440#true} call #t~ret17 := main(); {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {693440#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;havoc ~cond~0; {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {693440#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {693440#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; {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {693440#true} assume !(0 != ~p1~0); {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {693440#true} assume !(0 != ~p2~0); {693440#true} is VALID [2022-04-15 18:04:11,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {693440#true} assume !(0 != ~p3~0); {693440#true} is VALID [2022-04-15 18:04:11,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {693440#true} assume !(0 != ~p4~0); {693440#true} is VALID [2022-04-15 18:04:11,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {693440#true} assume !(0 != ~p5~0); {693440#true} is VALID [2022-04-15 18:04:11,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {693440#true} assume !(0 != ~p6~0); {693440#true} is VALID [2022-04-15 18:04:11,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {693440#true} assume !(0 != ~p7~0); {693440#true} is VALID [2022-04-15 18:04:11,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {693440#true} assume !(0 != ~p8~0); {693440#true} is VALID [2022-04-15 18:04:11,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {693440#true} assume !(0 != ~p9~0); {693440#true} is VALID [2022-04-15 18:04:11,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {693440#true} assume !(0 != ~p10~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p1~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p2~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p3~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p4~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p5~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p6~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p7~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p8~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p9~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-15 18:04:11,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p10~0; {693441#false} is VALID [2022-04-15 18:04:11,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {693441#false} assume 1 != ~lk10~0; {693441#false} is VALID [2022-04-15 18:04:11,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {693441#false} assume !false; {693441#false} is VALID [2022-04-15 18:04:11,265 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 18:04:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:11,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143537539] [2022-04-15 18:04:11,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143537539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:11,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663136456] [2022-04-15 18:04:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663136456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:11,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:11,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:04:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916794092] [2022-04-15 18:04:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:11,266 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 18:04:11,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:11,267 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 18:04:11,285 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 18:04:11,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:04:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:04:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:04:11,287 INFO L87 Difference]: Start difference. First operand 17673 states and 23303 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)